Base | Representation |
---|---|
bin | 100001100000000001001… |
… | …111100101000110101101 |
3 | 22011002011221012022122121 |
4 | 201200001033211012231 |
5 | 300204222033111023 |
6 | 4521325244312541 |
7 | 325215522311641 |
oct | 41400117450655 |
9 | 8132157168577 |
10 | 2302123332013 |
11 | 80836367192a |
12 | 312200542751 |
13 | 13912125ca4b |
14 | 7d5cd9d2c21 |
15 | 3ed3bcb1d5d |
hex | 218013e51ad |
2302123332013 has 2 divisors, whose sum is σ = 2302123332014. Its totient is φ = 2302123332012.
The previous prime is 2302123331953. The next prime is 2302123332029. The reversal of 2302123332013 is 3102333212032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2259483972964 + 42639359049 = 1503158^2 + 206493^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2302123332013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2302123332053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1151061666006 + 1151061666007.
It is an arithmetic number, because the mean of its divisors is an integer number (1151061666007).
Almost surely, 22302123332013 is an apocalyptic number.
It is an amenable number.
2302123332013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2302123332013 is an equidigital number, since it uses as much as digits as its factorization.
2302123332013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 2302123332013 its reverse (3102333212032), we get a palindrome (5404456544045).
The spelling of 2302123332013 in words is "two trillion, three hundred two billion, one hundred twenty-three million, three hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •