Base | Representation |
---|---|
bin | 1011110110100100110110… |
… | …0100100101001010111011 |
3 | 1201010212110200002111122221 |
4 | 2331221031210211022323 |
5 | 3202010002421224011 |
6 | 43414531432424511 |
7 | 2513355602024410 |
oct | 275511544451273 |
9 | 51125420074587 |
10 | 13032232211131 |
11 | 4174a36374011 |
12 | 1565898248137 |
13 | 736c1b64c3b3 |
14 | 330a98ad4107 |
15 | 178ee9241971 |
hex | bda4d9252bb |
13032232211131 has 16 divisors (see below), whose sum is σ = 15033501743616. Its totient is φ = 11066178056256.
The previous prime is 13032232211099. The next prime is 13032232211153. The reversal of 13032232211131 is 13111223223031.
It is a cyclic number.
It is not a de Polignac number, because 13032232211131 - 25 = 13032232211099 is a prime.
It is a super-2 number, since 2×130322322111312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13032232211096 and 13032232211105.
It is not an unprimeable number, because it can be changed into a prime (13032232211731) 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, 13485121 + ... + 14419186.
It is an arithmetic number, because the mean of its divisors is an integer number (939593858976).
Almost surely, 213032232211131 is an apocalyptic number.
13032232211131 is a deficient number, since it is larger than the sum of its proper divisors (2001269532485).
13032232211131 is a wasteful number, since it uses less digits than its factorization.
13032232211131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27904938.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 13032232211131 its reverse (13111223223031), we get a palindrome (26143455434162).
The spelling of 13032232211131 in words is "thirteen trillion, thirty-two billion, two hundred thirty-two million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •