Base | Representation |
---|---|
bin | 101110101101100000… |
… | …0011111001001000111 |
3 | 100120220212000221222212 |
4 | 1131123000133021013 |
5 | 3120414120231043 |
6 | 114025435014035 |
7 | 10150542204326 |
oct | 1353300371107 |
9 | 316825027885 |
10 | 100311102023 |
11 | 395a6002710 |
12 | 17535b9a31b |
13 | 95c80c6892 |
14 | 4bd84c40bd |
15 | 29216dd018 |
hex | 175b01f247 |
100311102023 has 8 divisors (see below), whose sum is σ = 109433201040. Its totient is φ = 91189487680.
The previous prime is 100311102011. The next prime is 100311102029. The reversal of 100311102023 is 320201113001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100311102023 - 24 = 100311102007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100311101989 and 100311102007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100311102029) 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 7 ways as a sum of consecutive naturals, for example, 414611 + ... + 610347.
It is an arithmetic number, because the mean of its divisors is an integer number (13679150130).
Almost surely, 2100311102023 is an apocalyptic number.
100311102023 is a deficient number, since it is larger than the sum of its proper divisors (9122099017).
100311102023 is a wasteful number, since it uses less digits than its factorization.
100311102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242337.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 100311102023 its reverse (320201113001), we get a palindrome (420512215024).
The spelling of 100311102023 in words is "one hundred billion, three hundred eleven million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •