Base | Representation |
---|---|
bin | 100010001110110110101… |
… | …100011011101100101101 |
3 | 22022212222122121010010201 |
4 | 202032312230123230231 |
5 | 302020220011241023 |
6 | 5000403325433501 |
7 | 331645652611303 |
oct | 42166654335455 |
9 | 8285878533121 |
10 | 2352412212013 |
11 | 82771a403786 |
12 | 31bab610b891 |
13 | 140aa6b05c86 |
14 | 81c00840273 |
15 | 412d1bbabad |
hex | 223b6b1bb2d |
2352412212013 has 2 divisors, whose sum is σ = 2352412212014. Its totient is φ = 2352412212012.
The previous prime is 2352412211999. The next prime is 2352412212047. The reversal of 2352412212013 is 3102122142532.
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., 1452367240164 + 900044971849 = 1205142^2 + 948707^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2352412212013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2352412212713) 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, 1176206106006 + 1176206106007.
It is an arithmetic number, because the mean of its divisors is an integer number (1176206106007).
Almost surely, 22352412212013 is an apocalyptic number.
It is an amenable number.
2352412212013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2352412212013 is an equidigital number, since it uses as much as digits as its factorization.
2352412212013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 2352412212013 its reverse (3102122142532), we get a palindrome (5454534354545).
The spelling of 2352412212013 in words is "two trillion, three hundred fifty-two billion, four hundred twelve million, two hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •