Base | Representation |
---|---|
bin | 1001000110001100110101… |
… | …1101111001000100100111 |
3 | 1022102012020201010210211221 |
4 | 2101203031131321010213 |
5 | 2302333331020432221 |
6 | 33134525432241211 |
7 | 2051426062660540 |
oct | 221431535710447 |
9 | 38365221123757 |
10 | 10002131030311 |
11 | 32069752366a2 |
12 | 1156591540207 |
13 | 5772737bc2c4 |
14 | 26816a1754c7 |
15 | 1252a2089541 |
hex | 918cd779127 |
10002131030311 has 8 divisors (see below), whose sum is σ = 11431052850560. Its totient is φ = 8573220699768.
The previous prime is 10002131030273. The next prime is 10002131030321. The reversal of 10002131030311 is 11303013120001.
10002131030311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10002131030311 - 29 = 10002131029799 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002131030321) 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, 918381 + ... + 4565926.
It is an arithmetic number, because the mean of its divisors is an integer number (1428881606320).
Almost surely, 210002131030311 is an apocalyptic number.
10002131030311 is a deficient number, since it is larger than the sum of its proper divisors (1428921820249).
10002131030311 is an equidigital number, since it uses as much as digits as its factorization.
10002131030311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5744853.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 10002131030311 its reverse (11303013120001), we get a palindrome (21305144150312).
The spelling of 10002131030311 in words is "ten trillion, two billion, one hundred thirty-one million, thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.788 sec. • engine limits •