Base | Representation |
---|---|
bin | 1001001011111001111011… |
… | …0110111000101110001011 |
3 | 1022202120012122200222212000 |
4 | 2102332132312320232023 |
5 | 2310440033111114011 |
6 | 33251534233122043 |
7 | 2061465501352656 |
oct | 222763666705613 |
9 | 38676178628760 |
10 | 10100133301131 |
11 | 3244495a36245 |
12 | 1171582259323 |
13 | 58359146b173 |
14 | 26cbc5b6c89d |
15 | 127adac0e356 |
hex | 92f9edb8b8b |
10100133301131 has 8 divisors (see below), whose sum is σ = 14963160446160. Its totient is φ = 6733422200736.
The previous prime is 10100133301099. The next prime is 10100133301147. The reversal of 10100133301131 is 13110333100101.
10100133301131 is a `hidden beast` number, since 1 + 0 + 100 + 133 + 301 + 131 = 666.
It is not a de Polignac number, because 10100133301131 - 25 = 10100133301099 is a prime.
It is a super-2 number, since 2×101001333011312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10100133301331) 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, 187039505550 + ... + 187039505603.
It is an arithmetic number, because the mean of its divisors is an integer number (1870395055770).
Almost surely, 210100133301131 is an apocalyptic number.
10100133301131 is a deficient number, since it is larger than the sum of its proper divisors (4863027145029).
10100133301131 is an equidigital number, since it uses as much as digits as its factorization.
10100133301131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 374079011162 (or 374079011156 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 18.
Adding to 10100133301131 its reverse (13110333100101), we get a palindrome (23210466401232).
The spelling of 10100133301131 in words is "ten trillion, one hundred billion, one hundred thirty-three million, three hundred one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •