Recognised as Number
9,701,473
- Positive
- Odd
- Prime
- 7 digits
9,701,473 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 value9,701,473
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation9,701,473
Distinct prime factors19,701,473
Number of divisors2
Sum of divisors σ(n)9,701,474
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,701,472integers below n that share no factor with it
Carmichael function λ(n)9,701,472the 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, 9,701,4732 in total
Arithmetic
Previous number9,701,472
Next number9,701,474
Double19,402,946
Half4,850,736.5
Square94,118,578,369,729
Cube913,088,846,852,309,910,817
Square root3,114.718767401≈irrational, shown to 9 decimal places
Cube root213.277918278≈
Negation-9,701,473
Reciprocal1.03077131 × 10^-7≈
Representations
Decimal9,701,473
Binary10010100000010000110000124 bits
Octal45004141
Hexadecimal940861
Base 365RXPD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, seven hundred and one thousand, four hundred and seventy-three
Ordinalnine million, seven hundred and one thousand, four hundred and seventy-third
Scientific notation9.701473 × 10^6
Engineering notation9.701473 × 10^6
In other bases
Ternary200020212220211base 3; the most digit-efficient integer base after e: 15 digits
Quinary4440421343base 5; one hand: 10 digits
Septenary145314115base 7: 9 digits
Nonary20225824base 9; each digit is two ternary digits: 8 digits
Duodecimal32ba341base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal30cdddbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal44:54:51:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T10T00T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101000001100110100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100101000000100001100001
Bit length24 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits17within that length
Bit parityodd7 set bits, so odd; 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
Bytes394 08 61
Gray code110111100000110001010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100101000000100001100001
64-bit0000000000000000000000000000000000000000100101000000100001100001
One's complement11111111011010111111011110011110at 32 bits, every bit flipped
Bits reversed10000110000100000010100100000000at 32 bits
Rotated left by 100000001001010000001000011000010at 32 bits, wrapping
Shifted left by 11001010000001000011000010= 19,402,946, no wrap
Shifted right by 110010100000010000110000= 4,850,736, discarding the low bit
These bits as a double4.79316452 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,701,473 to the power 294,118,578,369,729
9,701,473 to the power 3913,088,846,852,309,910,817
9,701,473 to the power 48,858,306,794,338,819,587,423,533,441
9,701,473 to the power 585,938,624,190,994,611,079,260,549,242,458,593
First ten multiples9,701,473, 19,402,946, 29,104,419, 38,805,892, 48,507,365, 58,208,838, 67,910,311, 77,611,784, 87,313,257, 97,014,730
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 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1176the total stopping time
Highest value reached36,835,2883× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,701,473 → 29,104,420 → 14,552,210 → 7,276,105 → 21,828,316 → 10,914,158 → 5,457,079 → 16,371,238 → 8,185,619 → 24,556,858 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage970,147,300%
9,701,473% as a decimal97,014.73
9,701,473% of 1009,701,473
9,701,473% of 1,00097,014,730
As a fraction of 1009,701,473/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,701,473
Nerdulate something else
Nothing in mind? Surprise me · today’s page