Base | Representation |
---|---|
bin | 11101001000100010111… |
… | …00010011001000010111 |
3 | 10112200210210202100120101 |
4 | 32210101130103020113 |
5 | 112400042110323111 |
6 | 2043510124514531 |
7 | 132215131463065 |
oct | 16442134231027 |
9 | 3480723670511 |
10 | 1001020011031 |
11 | 356591777317 |
12 | 1420076aba47 |
13 | 7351b6c1171 |
14 | 36641ac3035 |
15 | 1b08b09bbc1 |
hex | e911713217 |
1001020011031 has 8 divisors (see below), whose sum is σ = 1002986354304. Its totient is φ = 999053868600.
The previous prime is 1001020011011. The next prime is 1001020011073. The reversal of 1001020011031 is 1301100201001.
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 1001020011031 - 213 = 1001020002839 is a prime.
It is a super-2 number, since 2×10010200110312 (a number of 25 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 = 1001020010999 and 1001020011017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001020011001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13480956 + ... + 13555006.
It is an arithmetic number, because the mean of its divisors is an integer number (125373294288).
Almost surely, 21001020011031 is an apocalyptic number.
1001020011031 is a deficient number, since it is larger than the sum of its proper divisors (1966343273).
1001020011031 is an equidigital number, since it uses as much as digits as its factorization.
1001020011031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100421.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 1001020011031 its reverse (1301100201001), we get a palindrome (2302120212032).
The spelling of 1001020011031 in words is "one trillion, one billion, twenty million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •