Base | Representation |
---|---|
bin | 1100000101100111100100… |
… | …1100111010001010110111 |
3 | 1202001120112002210020200212 |
4 | 3001121321030322022313 |
5 | 3220223234013202301 |
6 | 44133351305100035 |
7 | 2541135000030524 |
oct | 301317114721267 |
9 | 52046462706625 |
10 | 13290662240951 |
11 | 42645a1391457 |
12 | 15a799ba8761b |
13 | 7553c50783c4 |
14 | 33d3b2d5014b |
15 | 180ac219c4bb |
hex | c167933a2b7 |
13290662240951 has 2 divisors, whose sum is σ = 13290662240952. Its totient is φ = 13290662240950.
The previous prime is 13290662240909. The next prime is 13290662240969. The reversal of 13290662240951 is 15904226609231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13290662240951 - 234 = 13273482371767 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13290662240951.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13290662240551) 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, 6645331120475 + 6645331120476.
It is an arithmetic number, because the mean of its divisors is an integer number (6645331120476).
Almost surely, 213290662240951 is an apocalyptic number.
13290662240951 is a deficient number, since it is larger than the sum of its proper divisors (1).
13290662240951 is an equidigital number, since it uses as much as digits as its factorization.
13290662240951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 50.
The spelling of 13290662240951 in words is "thirteen trillion, two hundred ninety billion, six hundred sixty-two million, two hundred forty thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •