Base | Representation |
---|---|
bin | 1100000010001101011101… |
… | …0110101001111011001011 |
3 | 1201211222101122202200111012 |
4 | 3000203113112221323023 |
5 | 3213243331222441021 |
6 | 44050425400554135 |
7 | 2533663035610325 |
oct | 300432726517313 |
9 | 51758348680435 |
10 | 13232112312011 |
11 | 424178649222a |
12 | 159857b78294b |
13 | 74ca23b7b538 |
14 | 33a61acc4615 |
15 | 17e2e6dd035b |
hex | c08d75a9ecb |
13232112312011 has 16 divisors (see below), whose sum is σ = 13899991618560. Its totient is φ = 12571960816800.
The previous prime is 13232112312007. The next prime is 13232112312049. The reversal of 13232112312011 is 11021321123231.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13232112312011 - 22 = 13232112312007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13232112312911) 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 15 ways as a sum of consecutive naturals, for example, 44406626 + ... + 44703608.
It is an arithmetic number, because the mean of its divisors is an integer number (868749476160).
Almost surely, 213232112312011 is an apocalyptic number.
13232112312011 is a deficient number, since it is larger than the sum of its proper divisors (667879306549).
13232112312011 is a wasteful number, since it uses less digits than its factorization.
13232112312011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309986.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 13232112312011 its reverse (11021321123231), we get a palindrome (24253433435242).
The spelling of 13232112312011 in words is "thirteen trillion, two hundred thirty-two billion, one hundred twelve million, three hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •