Recognised as Number
1,470,302
- Positive
- Even
- Composite
- 7 digits
1,470,302 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,470,302
Digit count7
Digit sum17
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 331 × 2,221
Distinct prime factors32, 331, 2,221
Number of divisors8
Sum of divisors σ(n)2,213,112
Aliquot sum742,810sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)732,600integers below n that share no factor with it
Carmichael function λ(n)24,420the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 732,600
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 331, 662, 2,221, 4,442, 735,151, 1,470,3028 in total
Arithmetic
Previous number1,470,301
Next number1,470,303
Double2,940,604
Half735,151
Square2,161,787,971,204
Cube3,178,481,177,637,183,608
Square root1,212.560101603≈irrational, shown to 9 decimal places
Cube root113.710922454≈
Negation-1,470,302
Reciprocal6.80132381 × 10^-7≈
Representations
Decimal1,470,302
Binary10110011011110101111021 bits
Octal5467536
Hexadecimal166F5E
Base 36VIHQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seventy thousand, three hundred and two
Ordinalone million, four hundred and seventy thousand, three hundred and second
Scientific notation1.470302 × 10^6
Engineering notation1.470302 × 10^6
In other bases
Ternary2202200212122base 3; the most digit-efficient integer base after e: 13 digits
Quinary334022202base 5; one hand: 9 digits
Septenary15332411base 7: 8 digits
Nonary2680778base 9; each digit is two ternary digits: 7 digits
Duodecimal5aaa52base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal93ff2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:48:25:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T10T010T0T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111011000010100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100110111101011110
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; 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 6f 5e
Gray code111010101100011110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100110111101011110
64-bit0000000000000000000000000000000000000000000101100110111101011110
One's complement11111111111010011001000010100001at 32 bits, every bit flipped
Bits reversed01111010111101100110100000000000at 32 bits
Rotated left by 100000000001011001101111010111100at 32 bits, wrapping
Shifted left by 11011001101111010111100= 2,940,604, no wrap
Shifted right by 110110011011110101111= 735,151, discarding the low bit
These bits as a double7.26425707 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,470,302 to the power 22,161,787,971,204
1,470,302 to the power 33,178,481,177,637,183,608
1,470,302 to the power 44,673,327,232,442,306,333,209,616
1,470,302 to the power 56,871,202,376,514,387,886,330,764,824,032
First ten multiples1,470,302, 2,940,604, 4,410,906, 5,881,208, 7,351,510, 8,821,812, 10,292,114, 11,762,416, 13,232,718, 14,703,020
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 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 2
Divisible by 100No, remainder 2
Collatz (3n + 1) trajectory
Steps to reach 1168the total stopping time
Highest value reached7,443,4125× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,470,302 → 735,151 → 2,205,454 → 1,102,727 → 3,308,182 → 1,654,091 → 4,962,274 → 2,481,137 → 7,443,412 → 3,721,706 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage147,030,200%
1,470,302% as a decimal14,703.02
1,470,302% of 1001,470,302
1,470,302% of 1,00014,703,020
As a fraction of 1001,470,302/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,470,302
Nerdulate something else
Nothing in mind? Surprise me · today’s page