Recognised as Number
4,732,447
- Positive
- Odd
- Prime
- 7 digits
4,732,447 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,732,447
Digit count7
Digit sum31
Digit product18,816
Multiplicative persistence6times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,732,447
Distinct prime factors14,732,447
Number of divisors2
Sum of divisors σ(n)4,732,448
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,732,446integers below n that share no factor with it
Carmichael function λ(n)4,732,446the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 4,732,4472 in total
Arithmetic
Previous number4,732,446
Next number4,732,448
Double9,464,894
Half2,366,223.5
Square22,396,054,607,809
Cube105,988,141,440,561,878,623
Square root2,175.418810252≈irrational, shown to 9 decimal places
Cube root167.891452462≈
Negation-4,732,447
Reciprocal2.11307174 × 10^-7≈
Representations
Decimal4,732,447
Binary1001000001101100001111123 bits
Octal22033037
Hexadecimal48361F
Base 362TFKV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seven hundred and thirty-two thousand, four hundred and forty-seven
Ordinalfour million, seven hundred and thirty-two thousand, four hundred and forty-seventh
Scientific notation4.732447 × 10^6
Engineering notation4.732447 × 10^6
In other bases
Ternary22220102200211base 3; the most digit-efficient integer base after e: 14 digits
Quinary2202414242base 5; one hand: 10 digits
Septenary55140136base 7: 8 digits
Nonary8812624base 9; each digit is two ternary digits: 7 digits
Duodecimal1702827base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal19bb27base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal21:54:34:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1000T0110T01T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000100101001100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010010000011011000011111
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes348 36 1f
Gray code11011000010110100010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010010000011011000011111
64-bit0000000000000000000000000000000000000000010010000011011000011111
One's complement11111111101101111100100111100000at 32 bits, every bit flipped
Bits reversed11111000011011000001001000000000at 32 bits
Rotated left by 100000000100100000110110000111110at 32 bits, wrapping
Shifted left by 1100100000110110000111110= 9,464,894, no wrap
Shifted right by 11001000001101100001111= 2,366,223, discarding the low bit
These bits as a double2.33813948 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,732,447 to the power 222,396,054,607,809
4,732,447 to the power 3105,988,141,440,561,878,623
4,732,447 to the power 4501,583,261,995,962,740,803,780,481
4,732,447 to the power 52,373,716,203,483,007,884,828,628,525,967,007
First ten multiples4,732,447, 9,464,894, 14,197,341, 18,929,788, 23,662,235, 28,394,682, 33,127,129, 37,859,576, 42,592,023, 47,324,470
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1237the total stopping time
Highest value reached71,874,05215× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,732,447 → 14,197,342 → 7,098,671 → 21,296,014 → 10,648,007 → 31,944,022 → 15,972,011 → 47,916,034 → 23,958,017 → 71,874,052 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage473,244,700%
4,732,447% as a decimal47,324.47
4,732,447% of 1004,732,447
4,732,447% of 1,00047,324,470
As a fraction of 1004,732,447/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 4,732,447
Nerdulate something else
Nothing in mind? Surprise me · today’s page