Recognised as Number
9,472,963
- Positive
- Odd
- Composite
- 7 digits
9,472,963 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,472,963
Digit count7
Digit sum40
Digit product81,648
Multiplicative persistence4times 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 factorisation19 × 498,577
Distinct prime factors219, 498,577
Number of divisors4
Sum of divisors σ(n)9,971,560
Aliquot sum498,597sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)8,974,368integers below n that share no factor with it
Carmichael function λ(n)1,495,728the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,974,368
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 498,577, 9,472,9634 in total
Arithmetic
Previous number9,472,962
Next number9,472,964
Double18,945,926
Half4,736,481.5
Square89,737,027,999,369
Cube850,075,545,967,986,560,347
Square root3,077.817895848≈irrational, shown to 9 decimal places
Cube root211.590069073≈
Negation-9,472,963
Reciprocal1.05563592 × 10^-7≈
Representations
Decimal9,472,963
Binary10010000100010111100001124 bits
Octal44105703
Hexadecimal908BC3
Base 365N1DV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, four hundred and seventy-two thousand, nine hundred and sixty-three
Ordinalnine million, four hundred and seventy-two thousand, nine hundred and sixty-third
Scientific notation9.472963 × 10^6
Engineering notation9.472963 × 10^6
In other bases
Ternary122211021110111base 3; the most digit-efficient integer base after e: 15 digits
Quinary4411113323base 5; one hand: 10 digits
Septenary143342653base 7: 9 digits
Nonary18737414base 9; each digit is two ternary digits: 8 digits
Duodecimal320a057base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2j4283base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:51:22:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T111T1110111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100011001110011000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100100001000101111000011
Bit length24 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits14within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes390 8b c3
Gray code110110001100111000100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100100001000101111000011
64-bit0000000000000000000000000000000000000000100100001000101111000011
One's complement11111111011011110111010000111100at 32 bits, every bit flipped
Bits reversed11000011110100010000100100000000at 32 bits
Rotated left by 100000001001000010001011110000110at 32 bits, wrapping
Shifted left by 11001000010001011110000110= 18,945,926, no wrap
Shifted right by 110010000100010111100001= 4,736,481, discarding the low bit
These bits as a double4.68026558 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,472,963 to the power 289,737,027,999,369
9,472,963 to the power 3850,075,545,967,986,560,347
9,472,963 to the power 48,052,734,194,159,535,870,664,398,161
9,472,963 to the power 576,283,253,070,108,099,399,976,629,196,421,043
First ten multiples9,472,963, 18,945,926, 28,418,889, 37,891,852, 47,364,815, 56,837,778, 66,310,741, 75,783,704, 85,256,667, 94,729,630
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1101the total stopping time
Highest value reached42,628,3364× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,472,963 → 28,418,890 → 14,209,445 → 42,628,336 → 21,314,168 → 10,657,084 → 5,328,542 → 2,664,271 → 7,992,814 → 3,996,407 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage947,296,300%
9,472,963% as a decimal94,729.63
9,472,963% of 1009,472,963
9,472,963% of 1,00094,729,630
As a fraction of 1009,472,963/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 9,472,963
Nerdulate something else
Nothing in mind? Surprise me · today’s page