Base | Representation |
---|---|
bin | 1001010011011110110101… |
… | …1101010111111001001101 |
3 | 1100020000012021020211222201 |
4 | 2110313231131113321031 |
5 | 2320103124031011023 |
6 | 33431422503241501 |
7 | 2104054252665436 |
oct | 224675535277115 |
9 | 40200167224881 |
10 | 10230301032013 |
11 | 3294712258037 |
12 | 119284b149291 |
13 | 59293700c22a |
14 | 27521361a48d |
15 | 12b1a8655bad |
hex | 94ded757e4d |
10230301032013 has 2 divisors, whose sum is σ = 10230301032014. Its totient is φ = 10230301032012.
The previous prime is 10230301031983. The next prime is 10230301032043. The reversal of 10230301032013 is 31023010303201.
It is a balanced prime because it is at equal distance from previous prime (10230301031983) and next prime (10230301032043).
It can be written as a sum of positive squares in only one way, i.e., 9761113021284 + 469188010729 = 3124278^2 + 684973^2 .
It is a cyclic number.
It is not a de Polignac number, because 10230301032013 - 25 = 10230301031981 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10230301032043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5115150516006 + 5115150516007.
It is an arithmetic number, because the mean of its divisors is an integer number (5115150516007).
Almost surely, 210230301032013 is an apocalyptic number.
It is an amenable number.
10230301032013 is a deficient number, since it is larger than the sum of its proper divisors (1).
10230301032013 is an equidigital number, since it uses as much as digits as its factorization.
10230301032013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10230301032013 its reverse (31023010303201), we get a palindrome (41253311335214).
The spelling of 10230301032013 in words is "ten trillion, two hundred thirty billion, three hundred one million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •