Base | Representation |
---|---|
bin | 1100000000100001011101… |
… | …0110000010111101001111 |
3 | 1201202012120012201200211122 |
4 | 3000020113112002331033 |
5 | 3212304443001420101 |
6 | 44025232523111155 |
7 | 2531615435560661 |
oct | 300102726027517 |
9 | 51665505650748 |
10 | 13203121123151 |
11 | 423045973aa13 |
12 | 1592a2a6724bb |
13 | 74a0837ba00b |
14 | 33906a83c531 |
15 | 17d69bb2851b |
hex | c0217582f4f |
13203121123151 has 2 divisors, whose sum is σ = 13203121123152. Its totient is φ = 13203121123150.
The previous prime is 13203121123111. The next prime is 13203121123187. The reversal of 13203121123151 is 15132112130231.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13203121123151 - 226 = 13203054014287 is a prime.
It is a super-2 number, since 2×132031211231512 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13203121123151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13203121123111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6601560561575 + 6601560561576.
It is an arithmetic number, because the mean of its divisors is an integer number (6601560561576).
Almost surely, 213203121123151 is an apocalyptic number.
13203121123151 is a deficient number, since it is larger than the sum of its proper divisors (1).
13203121123151 is an equidigital number, since it uses as much as digits as its factorization.
13203121123151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 13203121123151 its reverse (15132112130231), we get a palindrome (28335233253382).
The spelling of 13203121123151 in words is "thirteen trillion, two hundred three billion, one hundred twenty-one million, one hundred twenty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •