Base | Representation |
---|---|
bin | 1100000010001101011010… |
… | …0111101110110011011111 |
3 | 1201211222100210121201222202 |
4 | 3000203112213232303133 |
5 | 3213243320100324411 |
6 | 44050424241202115 |
7 | 2533662526216103 |
oct | 300432647566337 |
9 | 51758323551882 |
10 | 13232100011231 |
11 | 424177a5504a2 |
12 | 159857763033b |
13 | 74ca2146267a |
14 | 33a619401903 |
15 | 17e2e5ca083b |
hex | c08d69eecdf |
13232100011231 has 4 divisors (see below), whose sum is σ = 13261054278672. Its totient is φ = 13203145743792.
The previous prime is 13232100011219. The next prime is 13232100011261. The reversal of 13232100011231 is 13211000123231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13232100011231 - 26 = 13232100011167 is a prime.
It is a super-2 number, since 2×132321000112312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13232100011261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14477133035 + ... + 14477133948.
It is an arithmetic number, because the mean of its divisors is an integer number (3315263569668).
Almost surely, 213232100011231 is an apocalyptic number.
13232100011231 is a deficient number, since it is larger than the sum of its proper divisors (28954267441).
13232100011231 is an equidigital number, since it uses as much as digits as its factorization.
13232100011231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28954267440.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13232100011231 its reverse (13211000123231), we get a palindrome (26443100134462).
The spelling of 13232100011231 in words is "thirteen trillion, two hundred thirty-two billion, one hundred million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •