Base | Representation |
---|---|
bin | 1100000000010110101100… |
… | …0001110010010110111100 |
3 | 1201201221002201211002100011 |
4 | 3000011223001302112330 |
5 | 3212233032403144012 |
6 | 44024034011113004 |
7 | 2531454002545552 |
oct | 300055301622674 |
9 | 51657081732304 |
10 | 13200230131132 |
11 | 422a205863910 |
12 | 1592362442764 |
13 | 749a12881455 |
14 | 338c748cdbd2 |
15 | 17d57ce181a7 |
hex | c016b0725bc |
13200230131132 has 12 divisors (see below), whose sum is σ = 25200439341336. Its totient is φ = 6000104605040.
The previous prime is 13200230131087. The next prime is 13200230131177. The reversal of 13200230131132 is 23113103200231.
It is an interprime number because it is at equal distance from previous prime (13200230131087) and next prime (13200230131177).
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 150002615083 + ... + 150002615170.
It is an arithmetic number, because the mean of its divisors is an integer number (2100036611778).
Almost surely, 213200230131132 is an apocalyptic number.
It is an amenable number.
13200230131132 is a deficient number, since it is larger than the sum of its proper divisors (12000209210204).
13200230131132 is a wasteful number, since it uses less digits than its factorization.
13200230131132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300005230268 (or 300005230266 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13200230131132 its reverse (23113103200231), we get a palindrome (36313333331363).
The spelling of 13200230131132 in words is "thirteen trillion, two hundred billion, two hundred thirty million, one hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •