Recognised as Number
1,457,006
- Positive
- Even
- Composite
- 7 digits
1,457,006 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,457,006
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 173 × 4,211
Distinct prime factors32, 173, 4,211
Number of divisors8
Sum of divisors σ(n)2,198,664
Aliquot sum741,658sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)724,120integers below n that share no factor with it
Carmichael function λ(n)362,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 724,120
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 173, 346, 4,211, 8,422, 728,503, 1,457,0068 in total
Arithmetic
Previous number1,457,005
Next number1,457,007
Double2,914,012
Half728,503
Square2,122,866,484,036
Cube3,093,029,204,439,356,216
Square root1,207.06503553≈irrational, shown to 9 decimal places
Cube root113.367119877≈
Negation-1,457,006
Reciprocal6.86338972 × 10^-7≈
Representations
Decimal1,457,006
Binary10110001110110110111021 bits
Octal5435556
Hexadecimal163B6E
Base 36V88E
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and fifty-seven thousand and six
Ordinalone million, four hundred and fifty-seven thousand and sixth
Scientific notation1.457006 × 10^6
Engineering notation1.457006 × 10^6
In other bases
Ternary2202000122012base 3; the most digit-efficient integer base after e: 13 digits
Quinary333111011base 5; one hand: 9 digits
Septenary15245555base 7: 8 digits
Nonary2660565base 9; each digit is two ternary digits: 7 digits
Duodecimal5a3212base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal922a6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:44:43:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1T001T0T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010100100110010110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100011101101101110
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes316 3b 6e
Gray code111010010011011011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100011101101101110
64-bit0000000000000000000000000000000000000000000101100011101101101110
One's complement11111111111010011100010010010001at 32 bits, every bit flipped
Bits reversed01110110110111000110100000000000at 32 bits
Rotated left by 100000000001011000111011011011100at 32 bits, wrapping
Shifted left by 11011000111011011011100= 2,914,012, no wrap
Shifted right by 110110001110110110111= 728,503, discarding the low bit
These bits as a double7.1985661 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,457,006 to the power 22,122,866,484,036
1,457,006 to the power 33,093,029,204,439,356,216
1,457,006 to the power 44,506,562,109,043,368,642,849,296
1,457,006 to the power 56,566,088,032,248,842,372,843,281,367,776
First ten multiples1,457,006, 2,914,012, 4,371,018, 5,828,024, 7,285,030, 8,742,036, 10,199,042, 11,656,048, 13,113,054, 14,570,060
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 5
Divisible by 10No, remainder 6
Divisible by 11No, remainder 1
Divisible by 12No, remainder 2
Divisible by 100No, remainder 6
Collatz (3n + 1) trajectory
Steps to reach 1212the total stopping time
Highest value reached4,917,4003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,457,006 → 728,503 → 2,185,510 → 1,092,755 → 3,278,266 → 1,639,133 → 4,917,400 → 2,458,700 → 1,229,350 → 614,675 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage145,700,600%
1,457,006% as a decimal14,570.06
1,457,006% of 1001,457,006
1,457,006% of 1,00014,570,060
As a fraction of 1001,457,006/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,457,006
Nerdulate something else
Nothing in mind? Surprise me · today’s page