Base | Representation |
---|---|
bin | 1100000000111111010011… |
… | …1000111101100111000001 |
3 | 1201202222020120111122010102 |
4 | 3000033310320331213001 |
5 | 3212422400022231241 |
6 | 44033035525412145 |
7 | 2532321122511533 |
oct | 300176470754701 |
9 | 51688216448112 |
10 | 13211133008321 |
11 | 42338a0195916 |
12 | 15944a586a055 |
13 | 74aa5c631a81 |
14 | 3395ca91b853 |
15 | 17d9ba1c039b |
hex | c03f4e3d9c1 |
13211133008321 has 2 divisors, whose sum is σ = 13211133008322. Its totient is φ = 13211133008320.
The previous prime is 13211133008273. The next prime is 13211133008399. The reversal of 13211133008321 is 12380033111231.
13211133008321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12455817318400 + 755315689921 = 3529280^2 + 869089^2 .
It is a cyclic number.
It is not a de Polignac number, because 13211133008321 - 242 = 8813086497217 is a prime.
It is not a weakly prime, because it can be changed into another prime (13211133001321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6605566504160 + 6605566504161.
It is an arithmetic number, because the mean of its divisors is an integer number (6605566504161).
Almost surely, 213211133008321 is an apocalyptic number.
It is an amenable number.
13211133008321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13211133008321 is an equidigital number, since it uses as much as digits as its factorization.
13211133008321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 29.
Adding to 13211133008321 its reverse (12380033111231), we get a palindrome (25591166119552).
The spelling of 13211133008321 in words is "thirteen trillion, two hundred eleven billion, one hundred thirty-three million, eight thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •