Base | Representation |
---|---|
bin | 101110101101100000… |
… | …0001110010011000111 |
3 | 100120220211220110100121 |
4 | 1131123000032103013 |
5 | 3120414111024111 |
6 | 114025433322411 |
7 | 10150541466226 |
oct | 1353300162307 |
9 | 316824813317 |
10 | 100311033031 |
11 | 395a5a658a0 |
12 | 17535b66407 |
13 | 95c80a1361 |
14 | 4bd84a6cbd |
15 | 29216c7871 |
hex | 175b00e4c7 |
100311033031 has 16 divisors (see below), whose sum is σ = 113379960960. Its totient is φ = 87910189920.
The previous prime is 100311033023. The next prime is 100311033071. The reversal of 100311033031 is 130330113001.
It is a cyclic number.
It is not a de Polignac number, because 100311033031 - 23 = 100311033023 is a prime.
It is a super-2 number, since 2×1003110330312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100311032996 and 100311033014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100311033071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39405 + ... + 449638.
It is an arithmetic number, because the mean of its divisors is an integer number (7086247560).
Almost surely, 2100311033031 is an apocalyptic number.
100311033031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100311033031 is a deficient number, since it is larger than the sum of its proper divisors (13068927929).
100311033031 is a wasteful number, since it uses less digits than its factorization.
100311033031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 489726.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 100311033031 its reverse (130330113001), we get a palindrome (230641146032).
The spelling of 100311033031 in words is "one hundred billion, three hundred eleven million, thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •