Base | Representation |
---|---|
bin | 1001000111011110101110… |
… | …0001000000100000000011 |
3 | 1022111021222110110011100012 |
4 | 2101313223201000200003 |
5 | 2303213334130001011 |
6 | 33153002414015135 |
7 | 2053134535100003 |
oct | 221675341004003 |
9 | 38437873404305 |
10 | 10024110000131 |
11 | 3215223848a67 |
12 | 115a8a61a74ab |
13 | 579367189ca6 |
14 | 269253200003 |
15 | 125b3b911a8b |
hex | 91deb840803 |
10024110000131 has 16 divisors (see below), whose sum is σ = 11123818229760. Its totient is φ = 8994649847040.
The previous prime is 10024110000077. The next prime is 10024110000143. The reversal of 10024110000131 is 13100001142001.
It is a cyclic number.
It is not a de Polignac number, because 10024110000131 - 210 = 10024109999107 is a prime.
It is a super-2 number, since 2×100241100001312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10024110000161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 181024046 + ... + 181079411.
It is an arithmetic number, because the mean of its divisors is an integer number (695238639360).
Almost surely, 210024110000131 is an apocalyptic number.
10024110000131 is a deficient number, since it is larger than the sum of its proper divisors (1099708229629).
10024110000131 is a wasteful number, since it uses less digits than its factorization.
10024110000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362103554.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 10024110000131 its reverse (13100001142001), we get a palindrome (23124111142132).
The spelling of 10024110000131 in words is "ten trillion, twenty-four billion, one hundred ten million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •