Base | Representation |
---|---|
bin | 1011111100110111011110… |
… | …1001000100001010100010 |
3 | 1201112012102221200102112220 |
4 | 2333031313221010022202 |
5 | 3210242324411242010 |
6 | 43540324234131510 |
7 | 2524233120622215 |
oct | 277156751041242 |
9 | 51465387612486 |
10 | 13140312212130 |
11 | 4206858749494 |
12 | 158281bb80b96 |
13 | 7441841328cc |
14 | 335dcccc577c |
15 | 17bc229ca970 |
hex | bf377a442a2 |
13140312212130 has 64 divisors (see below), whose sum is σ = 33392269336320. Its totient is φ = 3297919514624.
The previous prime is 13140312212107. The next prime is 13140312212197. The reversal of 13140312212130 is 3121221304131.
It is a self number, because there is not a number n which added to its sum of digits gives 13140312212130.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76116451 + ... + 76288889.
It is an arithmetic number, because the mean of its divisors is an integer number (521754208380).
Almost surely, 213140312212130 is an apocalyptic number.
13140312212130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13140312212130 is an abundant number, since it is smaller than the sum of its proper divisors (20251957124190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13140312212130 is a wasteful number, since it uses less digits than its factorization.
13140312212130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 321883.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 13140312212130 its reverse (3121221304131), we get a palindrome (16261533516261).
The spelling of 13140312212130 in words is "thirteen trillion, one hundred forty billion, three hundred twelve million, two hundred twelve thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •