Recognised as Number
1,413,441
- Positive
- Odd
- Composite
- 7 digits
1,413,441 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,413,441
Digit count7
Digit sum18
Digit product192
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 157,049
Distinct prime factors23, 157,049
Number of divisors6
Sum of divisors σ(n)2,041,650
Aliquot sum628,209sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)942,288integers below n that share no factor with it
Carmichael function λ(n)471,144the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 942,288
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 157,049, 471,147, 1,413,4416 in total
Arithmetic
Previous number1,413,440
Next number1,413,442
Double2,826,882
Half706,720.5
Square1,997,815,460,481
Cube2,823,794,282,277,725,121
Square root1,188.882248164≈irrational, shown to 9 decimal places
Cube root112.225761669≈
Negation-1,413,441
Reciprocal7.07493274 × 10^-7≈
Representations
Decimal1,413,441
Binary10101100100010100000121 bits
Octal5310501
Hexadecimal159141
Base 36UAM9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and thirteen thousand, four hundred and forty-one
Ordinalone million, four hundred and thirteen thousand, four hundred and forty-first
Scientific notation1.413441 × 10^6
Engineering notation1.413441 × 10^6
In other bases
Ternary2122210212200base 3; the most digit-efficient integer base after e: 13 digits
Quinary330212231base 5; one hand: 9 digits
Septenary15004551base 7: 8 digits
Nonary2583780base 9; each digit is two ternary digits: 7 digits
Duodecimal581b69base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8gdc1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:32:37:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T00T110T0T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101001000101000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101011001000101000001
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes315 91 41
Gray code111110101100111100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101011001000101000001
64-bit0000000000000000000000000000000000000000000101011001000101000001
One's complement11111111111010100110111010111110at 32 bits, every bit flipped
Bits reversed10000010100010011010100000000000at 32 bits
Rotated left by 100000000001010110010001010000010at 32 bits, wrapping
Shifted left by 11010110010001010000010= 2,826,882, no wrap
Shifted right by 110101100100010100000= 706,720, discarding the low bit
These bits as a double6.98332641 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,413,441 to the power 21,997,815,460,481
1,413,441 to the power 32,823,794,282,277,725,121
1,413,441 to the power 43,991,266,614,136,910,072,751,361
1,413,441 to the power 55,641,419,874,352,288,310,139,756,443,201
First ten multiples1,413,441, 2,826,882, 4,240,323, 5,653,764, 7,067,205, 8,480,646, 9,894,087, 11,307,528, 12,720,969, 14,134,410
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1106the total stopping time
Highest value reached4,240,3243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,413,441 → 4,240,324 → 2,120,162 → 1,060,081 → 3,180,244 → 1,590,122 → 795,061 → 2,385,184 → 1,192,592 → 596,296 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage141,344,100%
1,413,441% as a decimal14,134.41
1,413,441% of 1001,413,441
1,413,441% of 1,00014,134,410
As a fraction of 1001,413,441/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,413,441
Nerdulate something else
Nothing in mind? Surprise me · today’s page