Base | Representation |
---|---|
bin | 101110101101110001… |
… | …0100000011000111111 |
3 | 100120221110211001012110 |
4 | 1131123202200120333 |
5 | 3120423411120111 |
6 | 114030354105103 |
7 | 10151011046340 |
oct | 1353342403077 |
9 | 316843731173 |
10 | 100320020031 |
11 | 39600043970 |
12 | 17538b7b193 |
13 | 95c9bc9aca |
14 | 4bd97660c7 |
15 | 29223a05a6 |
hex | 175b8a063f |
100320020031 has 32 divisors (see below), whose sum is σ = 168384872448. Its totient is φ = 51608319840.
The previous prime is 100320020027. The next prime is 100320020081. The reversal of 100320020031 is 130020023001.
It is a happy number.
It is not a de Polignac number, because 100320020031 - 22 = 100320020027 is a prime.
It is a super-2 number, since 2×1003200200312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100320019989 and 100320020016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100320020081) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2084391 + ... + 2131976.
It is an arithmetic number, because the mean of its divisors is an integer number (5262027264).
Almost surely, 2100320020031 is an apocalyptic number.
100320020031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100320020031 is a deficient number, since it is larger than the sum of its proper divisors (68064852417).
100320020031 is a wasteful number, since it uses less digits than its factorization.
100320020031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4216491.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 100320020031 its reverse (130020023001), we get a palindrome (230340043032).
The spelling of 100320020031 in words is "one hundred billion, three hundred twenty million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •