Recognised as Number
1,407,059
- Positive
- Odd
- Composite
- 7 digits
1,407,059 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,407,059
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation31 × 45,389
Distinct prime factors231, 45,389
Number of divisors4
Sum of divisors σ(n)1,452,480
Aliquot sum45,421sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,361,640integers below n that share no factor with it
Carmichael function λ(n)680,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,361,640
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 31, 45,389, 1,407,0594 in total
Arithmetic
Previous number1,407,058
Next number1,407,060
Double2,814,118
Half703,529.5
Square1,979,815,029,481
Cube2,785,716,555,566,506,379
Square root1,186.195177869≈irrational, shown to 9 decimal places
Cube root112.056598732≈
Negation-1,407,059
Reciprocal7.10702252 × 10^-7≈
Representations
Decimal1,407,059
Binary10101011110000101001121 bits
Octal5274123
Hexadecimal157853
Base 36U5OZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seven thousand and fifty-nine
Ordinalone million, four hundred and seven thousand and fifty-ninth
Scientific notation1.407059 × 10^6
Engineering notation1.407059 × 10^6
In other bases
Ternary2122111010022base 3; the most digit-efficient integer base after e: 13 digits
Quinary330011214base 5; one hand: 9 digits
Septenary14650133base 7: 8 digits
Nonary2574108base 9; each digit is two ternary digits: 7 digits
Duodecimal57a32bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8fhcjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:30:50:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T11101010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101000100001010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010111100001010011
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; 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 78 53
Gray code111111100010001111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010111100001010011
64-bit0000000000000000000000000000000000000000000101010111100001010011
One's complement11111111111010101000011110101100at 32 bits, every bit flipped
Bits reversed11001010000111101010100000000000at 32 bits
Rotated left by 100000000001010101111000010100110at 32 bits, wrapping
Shifted left by 11010101111000010100110= 2,814,118, no wrap
Shifted right by 110101011110000101001= 703,529, discarding the low bit
These bits as a double6.95179514 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,407,059 to the power 21,979,815,029,481
1,407,059 to the power 32,785,716,555,566,506,379
1,407,059 to the power 43,919,667,550,958,852,899,129,361
1,407,059 to the power 55,515,203,504,584,612,601,396,059,559,299
First ten multiples1,407,059, 2,814,118, 4,221,177, 5,628,236, 7,035,295, 8,442,354, 9,849,413, 11,256,472, 12,663,531, 14,070,590
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1168the total stopping time
Highest value reached8,013,6525× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,407,059 → 4,221,178 → 2,110,589 → 6,331,768 → 3,165,884 → 1,582,942 → 791,471 → 2,374,414 → 1,187,207 → 3,561,622 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage140,705,900%
1,407,059% as a decimal14,070.59
1,407,059% of 1001,407,059
1,407,059% of 1,00014,070,590
As a fraction of 1001,407,059/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,407,059
Nerdulate something else
Nothing in mind? Surprise me · today’s page