Base | Representation |
---|---|
bin | 1001010011011110111000… |
… | …1000011011111111111111 |
3 | 1100020000020001111101121012 |
4 | 2110313232020123333333 |
5 | 2320103134423233043 |
6 | 33431423545225435 |
7 | 2104054450644134 |
oct | 224675610337777 |
9 | 40200201441535 |
10 | 10230312321023 |
11 | 32947186686a3 |
12 | 1192852a9227b |
13 | 592939462712 |
14 | 275214d1858b |
15 | 12b1a9635a18 |
hex | 94dee21bfff |
10230312321023 has 2 divisors, whose sum is σ = 10230312321024. Its totient is φ = 10230312321022.
The previous prime is 10230312321011. The next prime is 10230312321029. The reversal of 10230312321023 is 32012321303201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10230312321023 - 212 = 10230312316927 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10230312321023.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10230312321029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5115156160511 + 5115156160512.
It is an arithmetic number, because the mean of its divisors is an integer number (5115156160512).
Almost surely, 210230312321023 is an apocalyptic number.
10230312321023 is a deficient number, since it is larger than the sum of its proper divisors (1).
10230312321023 is an equidigital number, since it uses as much as digits as its factorization.
10230312321023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 10230312321023 its reverse (32012321303201), we get a palindrome (42242633624224).
The spelling of 10230312321023 in words is "ten trillion, two hundred thirty billion, three hundred twelve million, three hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •