Recognised as Number
1,470,538
- Positive
- Even
- Composite
- 7 digits
1,470,538 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,470,538
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 53 × 13,873
Distinct prime factors32, 53, 13,873
Number of divisors8
Sum of divisors σ(n)2,247,588
Aliquot sum777,050sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)721,344integers below n that share no factor with it
Carmichael function λ(n)180,336the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 721,344
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 53, 106, 13,873, 27,746, 735,269, 1,470,5388 in total
Arithmetic
Previous number1,470,537
Next number1,470,539
Double2,941,076
Half735,269
Square2,162,482,009,444
Cube3,180,011,969,203,760,872
Square root1,212.657412462≈irrational, shown to 9 decimal places
Cube root113.717006089≈
Negation-1,470,538
Reciprocal6.8002323 × 10^-7≈
Representations
Decimal1,470,538
Binary10110011100000100101021 bits
Octal5470112
Hexadecimal16704A
Base 36VIOA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seventy thousand, five hundred and thirty-eight
Ordinalone million, four hundred and seventy thousand, five hundred and thirty-eighth
Scientific notation1.470538 × 10^6
Engineering notation1.470538 × 10^6
In other bases
Ternary2202201012101base 3; the most digit-efficient integer base after e: 13 digits
Quinary334024123base 5; one hand: 9 digits
Septenary15333166base 7: 8 digits
Nonary2681171base 9; each digit is two ternary digits: 7 digits
Duodecimal5ab00abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal93g6ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:48:28:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T10T011TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111011000001011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100111000001001010
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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 70 4a
Gray code111010100100001101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100111000001001010
64-bit0000000000000000000000000000000000000000000101100111000001001010
One's complement11111111111010011000111110110101at 32 bits, every bit flipped
Bits reversed01010010000011100110100000000000at 32 bits
Rotated left by 100000000001011001110000010010100at 32 bits, wrapping
Shifted left by 11011001110000010010100= 2,941,076, no wrap
Shifted right by 110110011100000100101= 735,269, discarding the low bit
These bits as a double7.26542307 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,470,538 to the power 22,162,482,009,444
1,470,538 to the power 33,180,011,969,203,760,872
1,470,538 to the power 44,676,328,441,168,960,105,189,136
1,470,538 to the power 56,876,718,673,219,720,255,164,621,675,168
First ten multiples1,470,538, 2,941,076, 4,411,614, 5,882,152, 7,352,690, 8,823,228, 10,293,766, 11,764,304, 13,234,842, 14,705,380
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 188the total stopping time
Highest value reached2,205,8081× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,470,538 → 735,269 → 2,205,808 → 1,102,904 → 551,452 → 275,726 → 137,863 → 413,590 → 206,795 → 620,386 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage147,053,800%
1,470,538% as a decimal14,705.38
1,470,538% of 1001,470,538
1,470,538% of 1,00014,705,380
As a fraction of 1001,470,538/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,538
Nerdulate something else
Nothing in mind? Surprise me · today’s page