Base | Representation |
---|---|
bin | 1100000111011000101011… |
… | …0111001010000111000101 |
3 | 1202011110220000110212000201 |
4 | 3001312022313022013011 |
5 | 3221222423431100122 |
6 | 44155332120010501 |
7 | 2543261242544005 |
oct | 301661267120705 |
9 | 52143800425021 |
10 | 13321023300037 |
11 | 4276461413522 |
12 | 15b1853900a31 |
13 | 75822319931b |
14 | 340a53304005 |
15 | 18179c846a27 |
hex | c1d8adca1c5 |
13321023300037 has 2 divisors, whose sum is σ = 13321023300038. Its totient is φ = 13321023300036.
The previous prime is 13321023299923. The next prime is 13321023300043. The reversal of 13321023300037 is 73000332012331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8446050751681 + 4874972548356 = 2906209^2 + 2207934^2 .
It is a cyclic number.
It is not a de Polignac number, because 13321023300037 - 227 = 13320889082309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13321023299978 and 13321023300014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13321023330037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660511650018 + 6660511650019.
It is an arithmetic number, because the mean of its divisors is an integer number (6660511650019).
Almost surely, 213321023300037 is an apocalyptic number.
It is an amenable number.
13321023300037 is a deficient number, since it is larger than the sum of its proper divisors (1).
13321023300037 is an equidigital number, since it uses as much as digits as its factorization.
13321023300037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 28.
Adding to 13321023300037 its reverse (73000332012331), we get a palindrome (86321355312368).
The spelling of 13321023300037 in words is "thirteen trillion, three hundred twenty-one billion, twenty-three million, three hundred thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •