Base | Representation |
---|---|
bin | 11101110010010100010010… |
… | …110011101010110101111010 |
3 | 122011211120202210210111101120 |
4 | 131302110102303222311322 |
5 | 114132310234413430020 |
6 | 1142341025220330110 |
7 | 36410342463103116 |
oct | 3562242263526572 |
9 | 564746683714346 |
10 | 131001113030010 |
11 | 38817295128033 |
12 | 12838a87843936 |
13 | 5813476314462 |
14 | 244c6b8376746 |
15 | 102298d8bb740 |
hex | 772512cead7a |
131001113030010 has 32 divisors (see below), whose sum is σ = 315513634795200. Its totient is φ = 34810189749888.
The previous prime is 131001113030009. The next prime is 131001113030023. The reversal of 131001113030010 is 10030311100131.
It is a super-2 number, since 2×1310011130300102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7715015835 + ... + 7715032814.
It is an arithmetic number, because the mean of its divisors is an integer number (9859801087350).
Almost surely, 2131001113030010 is an apocalyptic number.
131001113030010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131001113030010 is an abundant number, since it is smaller than the sum of its proper divisors (184512521765190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131001113030010 is a wasteful number, since it uses less digits than its factorization.
131001113030010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15430048942.
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 131001113030010 its reverse (10030311100131), we get a palindrome (141031424130141).
The spelling of 131001113030010 in words is "one hundred thirty-one trillion, one billion, one hundred thirteen million, thirty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •