Base | Representation |
---|---|
bin | 1011110110100011111111… |
… | …0110110100001000111011 |
3 | 1201010211212122010011021020 |
4 | 2331220333312310020323 |
5 | 3202004020020010021 |
6 | 43414452532513523 |
7 | 2513350106140563 |
oct | 275507766641073 |
9 | 51124778104236 |
10 | 13032002110011 |
11 | 41749284a16a5 |
12 | 156583317b8a3 |
13 | 736bb2a860a1 |
14 | 330a76317da3 |
15 | 178ed3e3d7c6 |
hex | bda3fdb423b |
13032002110011 has 16 divisors (see below), whose sum is σ = 17472449702400. Its totient is φ = 8639823614400.
The previous prime is 13032002109989. The next prime is 13032002110037. The reversal of 13032002110011 is 11001120023031.
It is a happy number.
It is not a de Polignac number, because 13032002110011 - 27 = 13032002109883 is a prime.
It is a super-2 number, since 2×130320021100112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13032002110091) 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, 4563415 + ... + 6847536.
It is an arithmetic number, because the mean of its divisors is an integer number (1092028106400).
Almost surely, 213032002110011 is an apocalyptic number.
13032002110011 is a deficient number, since it is larger than the sum of its proper divisors (4440447592389).
13032002110011 is a wasteful number, since it uses less digits than its factorization.
13032002110011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11413066.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13032002110011 its reverse (11001120023031), we get a palindrome (24033122133042).
The spelling of 13032002110011 in words is "thirteen trillion, thirty-two billion, two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •