Base | Representation |
---|---|
bin | 1100000110010011011011… |
… | …1000001101100110010001 |
3 | 1202002200220112012222000102 |
4 | 3001210312320031212101 |
5 | 3220421341202434022 |
6 | 44143015355502145 |
7 | 2542032503641541 |
oct | 301446670154621 |
9 | 52080815188012 |
10 | 13302434421137 |
11 | 4269592489694 |
12 | 15aa126457955 |
13 | 75654cc650b4 |
14 | 33dbac5c7321 |
15 | 18106091aa92 |
hex | c1936e0d991 |
13302434421137 has 2 divisors, whose sum is σ = 13302434421138. Its totient is φ = 13302434421136.
The previous prime is 13302434421121. The next prime is 13302434421257. The reversal of 13302434421137 is 73112443420331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12361299666496 + 941134754641 = 3515864^2 + 970121^2 .
It is a cyclic number.
It is not a de Polignac number, because 13302434421137 - 24 = 13302434421121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13302434421137.
It is not a weakly prime, because it can be changed into another prime (13302434421337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6651217210568 + 6651217210569.
It is an arithmetic number, because the mean of its divisors is an integer number (6651217210569).
Almost surely, 213302434421137 is an apocalyptic number.
It is an amenable number.
13302434421137 is a deficient number, since it is larger than the sum of its proper divisors (1).
13302434421137 is an equidigital number, since it uses as much as digits as its factorization.
13302434421137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 145152, while the sum is 38.
Adding to 13302434421137 its reverse (73112443420331), we get a palindrome (86414877841468).
The spelling of 13302434421137 in words is "thirteen trillion, three hundred two billion, four hundred thirty-four million, four hundred twenty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •