Recognised as Number
1,473,476
- Positive
- Even
- Composite
- 7 digits
1,473,476 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,473,476
Digit count7
Digit sum32
Digit product14,112
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 368,369
Distinct prime factors22, 368,369
Number of divisors6
Sum of divisors σ(n)2,578,590
Aliquot sum1,105,114sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)736,736integers below n that share no factor with it
Carmichael function λ(n)368,368the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 736,736
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 368,369, 736,738, 1,473,4766 in total
Arithmetic
Previous number1,473,475
Next number1,473,477
Double2,946,952
Half736,738
Square2,171,131,522,576
Cube3,199,110,191,359,194,176
Square root1,213.868197129≈irrational, shown to 9 decimal places
Cube root113.792687758≈
Negation-1,473,476
Reciprocal6.78667315 × 10^-7≈
Representations
Decimal1,473,476
Binary10110011110111100010021 bits
Octal5475704
Hexadecimal167BC4
Base 36VKXW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and seventy-three thousand, four hundred and seventy-six
Ordinalone million, four hundred and seventy-three thousand, four hundred and seventy-sixth
Scientific notation1.473476 × 10^6
Engineering notation1.473476 × 10^6
In other bases
Ternary2202212020012base 3; the most digit-efficient integer base after e: 13 digits
Quinary334122401base 5; one hand: 9 digits
Septenary15344564base 7: 8 digits
Nonary2685205base 9; each digit is two ternary digits: 7 digits
Duodecimal5b0858base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal943dgbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:49:17:56base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T100TT1T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010111000110011000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101100111101111000100
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes316 7b c4
Gray code111010100011000100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101100111101111000100
64-bit0000000000000000000000000000000000000000000101100111101111000100
One's complement11111111111010011000010000111011at 32 bits, every bit flipped
Bits reversed00100011110111100110100000000000at 32 bits
Rotated left by 100000000001011001111011110001000at 32 bits, wrapping
Shifted left by 11011001111011110001000= 2,946,952, no wrap
Shifted right by 110110011110111100010= 736,738, discarding the low bit
These bits as a double7.27993872 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,473,476 to the power 22,171,131,522,576
1,473,476 to the power 33,199,110,191,359,194,176
1,473,476 to the power 44,713,812,088,323,179,997,675,776
1,473,476 to the power 56,945,688,980,654,085,970,255,311,717,376
First ten multiples1,473,476, 2,946,952, 4,420,428, 5,893,904, 7,367,380, 8,840,856, 10,314,332, 11,787,808, 13,261,284, 14,734,760
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 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10No, remainder 6
Divisible by 11No, remainder 4
Divisible by 12No, remainder 8
Divisible by 100No, remainder 76
Collatz (3n + 1) trajectory
Steps to reach 162the total stopping time
Highest value reached1,473,476
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,473,476 → 736,738 → 368,369 → 1,105,108 → 552,554 → 276,277 → 828,832 → 414,416 → 207,208 → 103,604 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage147,347,600%
1,473,476% as a decimal14,734.76
1,473,476% of 1001,473,476
1,473,476% of 1,00014,734,760
As a fraction of 1001,473,476/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,473,476
Nerdulate something else
Nothing in mind? Surprise me · today’s page