Base | Representation |
---|---|
bin | 111100100110010001… |
… | …1001100010111110100 |
3 | 110102220012210020200210 |
4 | 1321030203030113310 |
5 | 4113003112004022 |
6 | 135441000305420 |
7 | 12254552624013 |
oct | 1711443142764 |
9 | 412805706623 |
10 | 130133313012 |
11 | 5020995417a |
12 | 21279472270 |
13 | c36b6b0281 |
14 | 642708ca7a |
15 | 35b98e8a0c |
hex | 1e4c8cc5f4 |
130133313012 has 24 divisors (see below), whose sum is σ = 306035301376. Its totient is φ = 43036213248.
The previous prime is 130133313001. The next prime is 130133313019. The reversal of 130133313012 is 210313331031.
It is a self number, because there is not a number n which added to its sum of digits gives 130133313012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130133313019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42693133 + ... + 42696180.
Almost surely, 2130133313012 is an apocalyptic number.
130133313012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130133313012 is an abundant number, since it is smaller than the sum of its proper divisors (175901988364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130133313012 is a wasteful number, since it uses less digits than its factorization.
130133313012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85389447 (or 85389445 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 130133313012 its reverse (210313331031), we get a palindrome (340446644043).
The spelling of 130133313012 in words is "one hundred thirty billion, one hundred thirty-three million, three hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •