Recognised as Number
9,401,735
- Positive
- Odd
- Composite
- 7 digits
9,401,735 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,401,735
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 7 × 43 × 6,247
Distinct prime factors45, 7, 43, 6,247
Number of divisors16
Sum of divisors σ(n)13,195,776
Aliquot sum3,794,041sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,295,968integers below n that share no factor with it
Carmichael function λ(n)87,444the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,295,968
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 35, 43, 215, 301, 1,505, 6,247, 31,235, 43,729, 218,645, 268,621, 1,343,105, 1,880,347, 9,401,73516 in total
Arithmetic
Previous number9,401,734
Next number9,401,736
Double18,803,470
Half4,700,867.5
Square88,392,621,010,225
Cube831,043,998,693,567,740,375
Square root3,066.224877598≈irrational, shown to 9 decimal places
Cube root211.058413183≈
Negation-9,401,735
Reciprocal1.06363347 × 10^-7≈
Representations
Decimal9,401,735
Binary10001111011101011000011124 bits
Octal43672607
Hexadecimal8F7587
Base 365LIFB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine million, four hundred and one thousand, seven hundred and thirty-five
Ordinalnine million, four hundred and one thousand, seven hundred and thirty-fifth
Scientific notation9.401735 × 10^6
Engineering notation9.401735 × 10^6
In other bases
Ternary122200122202102base 3; the most digit-efficient integer base after e: 15 digits
Quinary4401323420base 5; one hand: 10 digits
Septenary142625210base 7: 9 digits
Nonary18618672base 9; each digit is two ternary digits: 8 digits
Duodecimal319499bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal2if46fbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal43:31:35:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T01T00T1T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100001000101010011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000100011110111010110000111
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 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
Bytes38f 75 87
Gray code110010001100111101000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000100011110111010110000111
64-bit0000000000000000000000000000000000000000100011110111010110000111
One's complement11111111011100001000101001111000at 32 bits, every bit flipped
Bits reversed11100001101011101111000100000000at 32 bits
Rotated left by 100000001000111101110101100001110at 32 bits, wrapping
Shifted left by 11000111101110101100001110= 18,803,470, no wrap
Shifted right by 110001111011101011000011= 4,700,867, discarding the low bit
These bits as a double4.64507427 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
9,401,735 to the power 288,392,621,010,225
9,401,735 to the power 3831,043,998,693,567,740,375
9,401,735 to the power 47,813,255,449,057,270,099,554,550,625
9,401,735 to the power 573,458,157,219,342,453,299,435,503,020,334,375
First ten multiples9,401,735, 18,803,470, 28,205,205, 37,606,940, 47,008,675, 56,410,410, 65,812,145, 75,213,880, 84,615,615, 94,017,350
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 2
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 35
Collatz (3n + 1) trajectory
Steps to reach 1194the total stopping time
Highest value reached63,461,7166× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,401,735 → 28,205,206 → 14,102,603 → 42,307,810 → 21,153,905 → 63,461,716 → 31,730,858 → 15,865,429 → 47,596,288 → 23,798,144 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage940,173,500%
9,401,735% as a decimal94,017.35
9,401,735% of 1009,401,735
9,401,735% of 1,00094,017,350
As a fraction of 1009,401,735/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,401,735
Nerdulate something else
Nothing in mind? Surprise me · today’s page