Base | Representation |
---|---|
bin | 1011111100111000001101… |
… | …1100100001100001111100 |
3 | 1201112012221202022211222202 |
4 | 2333032003130201201330 |
5 | 3210243231111014012 |
6 | 43540400030531032 |
7 | 2524241044131335 |
oct | 277160334414174 |
9 | 51465852284882 |
10 | 13140510251132 |
11 | 420694a512090 |
12 | 1582876366a78 |
13 | 7441b6181454 |
14 | 33600b31728c |
15 | 17bc35098cc2 |
hex | bf38372187c |
13140510251132 has 12 divisors (see below), whose sum is σ = 25086428661336. Its totient is φ = 5972959205040.
The previous prime is 13140510251123. The next prime is 13140510251137. The reversal of 13140510251132 is 23115201504131.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 13140510251095 and 13140510251104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13140510251137) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 149323980083 + ... + 149323980170.
It is an arithmetic number, because the mean of its divisors is an integer number (2090535721778).
Almost surely, 213140510251132 is an apocalyptic number.
It is an amenable number.
13140510251132 is a deficient number, since it is larger than the sum of its proper divisors (11945918410204).
13140510251132 is a wasteful number, since it uses less digits than its factorization.
13140510251132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298647960268 (or 298647960266 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 13140510251132 its reverse (23115201504131), we get a palindrome (36255711755263).
The spelling of 13140510251132 in words is "thirteen trillion, one hundred forty billion, five hundred ten million, two hundred fifty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •