Recognised as Number
9,471,313
- Positive
- Odd
- Composite
- 7 digits
9,471,313 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,471,313
Digit count7
Digit sum28
Digit product2,268
Multiplicative persistence4times 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 factorisation29 × 326,597
Distinct prime factors229, 326,597
Number of divisors4
Sum of divisors σ(n)9,797,940
Aliquot sum326,627sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,144,688integers below n that share no factor with it
Carmichael function λ(n)2,286,172the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,144,688
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 29, 326,597, 9,471,3134 in total
Arithmetic
Previous number9,471,312
Next number9,471,314
Double18,942,626
Half4,735,656.5
Square89,705,769,943,969
Cube849,631,425,045,322,861,297
Square root3,077.549837127≈irrational, shown to 9 decimal places
Cube root211.577783446≈
Negation-9,471,313
Reciprocal1.05581982 × 10^-7≈
Representations
Decimal9,471,313
Binary10010000100001010101000124 bits
Octal44102521
Hexadecimal908551
Base 365N041
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, four hundred and seventy-one thousand, three hundred and thirteen
Ordinalnine million, four hundred and seventy-one thousand, three hundred and thirteenth
Scientific notation9.471313 × 10^6
Engineering notation9.471313 × 10^6
In other bases
Ternary122211012012101base 3; the most digit-efficient integer base after e: 15 digits
Quinary4411040223base 5; one hand: 10 digits
Septenary143335105base 7: 9 digits
Nonary18735171base 9; each digit is two ternary digits: 8 digits
Duodecimal3209101base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2j3i5dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:50:55:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T111TT1TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100011000010101010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100100001000010101010001
Bit length24 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits16within that length
Bit parityeven8 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 85 51
Gray code110110001100011111111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100100001000010101010001
64-bit0000000000000000000000000000000000000000100100001000010101010001
One's complement11111111011011110111101010101110at 32 bits, every bit flipped
Bits reversed10001010101000010000100100000000at 32 bits
Rotated left by 100000001001000010000101010100010at 32 bits, wrapping
Shifted left by 11001000010000101010100010= 18,942,626, no wrap
Shifted right by 110010000100001010101000= 4,735,656, discarding the low bit
These bits as a double4.67945037 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,471,313 to the power 289,705,769,943,969
9,471,313 to the power 3849,631,425,045,322,861,297
9,471,313 to the power 48,047,125,161,240,292,005,399,472,961
9,471,313 to the power 576,216,841,152,282,273,794,536,098,448,667,793
First ten multiples9,471,313, 18,942,626, 28,413,939, 37,885,252, 47,356,565, 56,827,878, 66,299,191, 75,770,504, 85,241,817, 94,713,130
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1225the total stopping time
Highest value reached91,027,3129× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,471,313 → 28,413,940 → 14,206,970 → 7,103,485 → 21,310,456 → 10,655,228 → 5,327,614 → 2,663,807 → 7,991,422 → 3,995,711 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage947,131,300%
9,471,313% as a decimal94,713.13
9,471,313% of 1009,471,313
9,471,313% of 1,00094,713,130
As a fraction of 1009,471,313/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,471,313
Nerdulate something else
Nothing in mind? Surprise me · today’s page