Base | Representation |
---|---|
bin | 111100100011001110… |
… | …1101101001000000100 |
3 | 110102122002122221002020 |
4 | 1321012131231020010 |
5 | 4112300442223022 |
6 | 135422512043140 |
7 | 12252203025363 |
oct | 1710635551004 |
9 | 412562587066 |
10 | 130031211012 |
11 | 5016725745a |
12 | 2124b2334b0 |
13 | c3534b1aa1 |
14 | 64176b17da |
15 | 35b097b35c |
hex | 1e4676d204 |
130031211012 has 48 divisors (see below), whose sum is σ = 319403582400. Its totient is φ = 41058800640.
The previous prime is 130031211007. The next prime is 130031211019. The reversal of 130031211012 is 210112130031.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 130031210982 and 130031211000.
It is not an unprimeable number, because it can be changed into a prime (130031211019) 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, 3714712 + ... + 3749552.
It is an arithmetic number, because the mean of its divisors is an integer number (6654241300).
Almost surely, 2130031211012 is an apocalyptic number.
130031211012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130031211012 is an abundant number, since it is smaller than the sum of its proper divisors (189372371388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130031211012 is a wasteful number, since it uses less digits than its factorization.
130031211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51236 (or 51234 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 130031211012 its reverse (210112130031), we get a palindrome (340143341043).
The spelling of 130031211012 in words is "one hundred thirty billion, thirty-one million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •