Base | Representation |
---|---|
bin | 10100110000101000010000… |
… | …01101011111010110101101 |
3 | 12222122020002201211201102202 |
4 | 22120110020031133112231 |
5 | 21440422423324040323 |
6 | 241031534411431245 |
7 | 12421125614136035 |
oct | 1230241015372655 |
9 | 188566081751382 |
10 | 45651345143213 |
11 | 13600699229187 |
12 | 5153653155525 |
13 | 1c61b9893b774 |
14 | b3b7733488c5 |
15 | 542769cabd28 |
hex | 29850835f5ad |
45651345143213 has 2 divisors, whose sum is σ = 45651345143214. Its totient is φ = 45651345143212.
The previous prime is 45651345143203. The next prime is 45651345143227. The reversal of 45651345143213 is 31234154315654.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45636753228004 + 14591915209 = 6755498^2 + 120797^2 .
It is a cyclic number.
It is not a de Polignac number, because 45651345143213 - 222 = 45651340948909 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (45651345143203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22825672571606 + 22825672571607.
It is an arithmetic number, because the mean of its divisors is an integer number (22825672571607).
Almost surely, 245651345143213 is an apocalyptic number.
It is an amenable number.
45651345143213 is a deficient number, since it is larger than the sum of its proper divisors (1).
45651345143213 is an equidigital number, since it uses as much as digits as its factorization.
45651345143213 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2592000, while the sum is 47.
Adding to 45651345143213 its reverse (31234154315654), we get a palindrome (76885499458867).
The spelling of 45651345143213 in words is "forty-five trillion, six hundred fifty-one billion, three hundred forty-five million, one hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •