Base | Representation |
---|---|
bin | 1100000010001101110101… |
… | …0110110011001011011011 |
3 | 1201211222122200020211120021 |
4 | 3000203131112303023123 |
5 | 3213244033012410321 |
6 | 44050443355211311 |
7 | 2533665400552663 |
oct | 300433526631333 |
9 | 51758580224507 |
10 | 13232213013211 |
11 | 4241828312565 |
12 | 15985a9446b37 |
13 | 74ca3b9a924a |
14 | 33a62a4191a3 |
15 | 17e300b72941 |
hex | c08dd5b32db |
13232213013211 has 2 divisors, whose sum is σ = 13232213013212. Its totient is φ = 13232213013210.
The previous prime is 13232213013203. The next prime is 13232213013287. The reversal of 13232213013211 is 11231031223231.
It is a weak prime.
It is an emirp because it is prime and its reverse (11231031223231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13232213013211 - 23 = 13232213013203 is a prime.
It is a super-2 number, since 2×132322130132112 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13232213013311) 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 as a sum of consecutive naturals, namely, 6616106506605 + 6616106506606.
It is an arithmetic number, because the mean of its divisors is an integer number (6616106506606).
Almost surely, 213232213013211 is an apocalyptic number.
13232213013211 is a deficient number, since it is larger than the sum of its proper divisors (1).
13232213013211 is an equidigital number, since it uses as much as digits as its factorization.
13232213013211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 13232213013211 its reverse (11231031223231), we get a palindrome (24463244236442).
The spelling of 13232213013211 in words is "thirteen trillion, two hundred thirty-two billion, two hundred thirteen million, thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •