Base | Representation |
---|---|
bin | 1100000111011000111110… |
… | …0011011010101100000111 |
3 | 1202011111002111120210100212 |
4 | 3001312033203122230013 |
5 | 3221223104103324033 |
6 | 44155344011030035 |
7 | 2543263216561313 |
oct | 301661743325407 |
9 | 52144074523325 |
10 | 13321102011143 |
11 | 42764a1894323 |
12 | 15b187613b31b |
13 | 758236597b44 |
14 | 340a5d952b43 |
15 | 1817a46e3748 |
hex | c1d8f8dab07 |
13321102011143 has 2 divisors, whose sum is σ = 13321102011144. Its totient is φ = 13321102011142.
The previous prime is 13321102011103. The next prime is 13321102011149. The reversal of 13321102011143 is 34111020112331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13321102011143 - 222 = 13321097816839 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13321102011149) 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, 6660551005571 + 6660551005572.
It is an arithmetic number, because the mean of its divisors is an integer number (6660551005572).
Almost surely, 213321102011143 is an apocalyptic number.
13321102011143 is a deficient number, since it is larger than the sum of its proper divisors (1).
13321102011143 is an equidigital number, since it uses as much as digits as its factorization.
13321102011143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 13321102011143 its reverse (34111020112331), we get a palindrome (47432122123474).
The spelling of 13321102011143 in words is "thirteen trillion, three hundred twenty-one billion, one hundred two million, eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •