Base | Representation |
---|---|
bin | 101110110000110110… |
… | …1101000110100001101 |
3 | 100121012200201112011020 |
4 | 1131201231220310031 |
5 | 3121131420221141 |
6 | 114044534144353 |
7 | 10153406346033 |
oct | 1354155506415 |
9 | 317180645136 |
10 | 100423601421 |
11 | 39653561120 |
12 | 175677b20b9 |
13 | 96154c5780 |
14 | 4c0940a553 |
15 | 292b511266 |
hex | 1761b68d0d |
100423601421 has 32 divisors (see below), whose sum is σ = 157619976192. Its totient is φ = 56069223360.
The previous prime is 100423601353. The next prime is 100423601423. The reversal of 100423601421 is 124106324001.
It is not a de Polignac number, because 100423601421 - 227 = 100289383693 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100423601391 and 100423601400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100423601423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16905 + ... + 448478.
It is an arithmetic number, because the mean of its divisors is an integer number (4925624256).
Almost surely, 2100423601421 is an apocalyptic number.
100423601421 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100423601421 is a deficient number, since it is larger than the sum of its proper divisors (57196374771).
100423601421 is a wasteful number, since it uses less digits than its factorization.
100423601421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465913.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 100423601421 its reverse (124106324001), we get a palindrome (224529925422).
The spelling of 100423601421 in words is "one hundred billion, four hundred twenty-three million, six hundred one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •