Base | Representation |
---|---|
bin | 1011110110100100011100… |
… | …0001011011010000110011 |
3 | 1201010212012000100002010022 |
4 | 2331221013001123100303 |
5 | 3202004241304112321 |
6 | 43414512505354055 |
7 | 2513353066045613 |
oct | 275510701332063 |
9 | 51125160302108 |
10 | 13032122332211 |
11 | 417498a345394 |
12 | 156586749892b |
13 | 736c0195a198 |
14 | 330a88290a43 |
15 | 178ede789dab |
hex | bda4705b433 |
13032122332211 has 8 divisors (see below), whose sum is σ = 13335278676720. Its totient is φ = 12728969793792.
The previous prime is 13032122332147. The next prime is 13032122332223. The reversal of 13032122332211 is 11223322123031.
13032122332211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13032122332211 - 26 = 13032122332147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13032122332711) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6679835 + ... + 8407403.
It is an arithmetic number, because the mean of its divisors is an integer number (1666909834590).
Almost surely, 213032122332211 is an apocalyptic number.
13032122332211 is a deficient number, since it is larger than the sum of its proper divisors (303156344509).
13032122332211 is a wasteful number, since it uses less digits than its factorization.
13032122332211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1903045.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 13032122332211 its reverse (11223322123031), we get a palindrome (24255444455242).
The spelling of 13032122332211 in words is "thirteen trillion, thirty-two billion, one hundred twenty-two million, three hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •