Base | Representation |
---|---|
bin | 1011110110100100011011… |
… | …1000111101000001111110 |
3 | 1201010212011212011020111202 |
4 | 2331221012320331001332 |
5 | 3202004240222024410 |
6 | 43414512350015502 |
7 | 2513353041135503 |
oct | 275510670750176 |
9 | 51125155136452 |
10 | 13032120111230 |
11 | 4174989068770 |
12 | 15658667a7592 |
13 | 736c013602ac |
14 | 330a87c734aa |
15 | 178ede49bca5 |
hex | bda46e3d07e |
13032120111230 has 32 divisors (see below), whose sum is σ = 26415839950848. Its totient is φ = 4586083322400.
The previous prime is 13032120111221. The next prime is 13032120111233. The reversal of 13032120111230 is 3211102123031.
It is a happy number.
It is a super-2 number, since 2×130321201112302 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13032120111233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1910864642 + ... + 1910871461.
It is an arithmetic number, because the mean of its divisors is an integer number (825494998464).
Almost surely, 213032120111230 is an apocalyptic number.
13032120111230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13032120111230 is an abundant number, since it is smaller than the sum of its proper divisors (13383719839618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032120111230 is a wasteful number, since it uses less digits than its factorization.
13032120111230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3821736152.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13032120111230 its reverse (3211102123031), we get a palindrome (16243222234261).
The spelling of 13032120111230 in words is "thirteen trillion, thirty-two billion, one hundred twenty million, one hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •