Base | Representation |
---|---|
bin | 1010100000011000111000… |
… | …01000101101101000101011 |
3 | 10000210122010211200220202122 |
4 | 11100030130020231220223 |
5 | 11012010122342200212 |
6 | 121045230152421455 |
7 | 4603100245313441 |
oct | 520143410555053 |
9 | 100718124626678 |
10 | 23103101131307 |
11 | 73a7a7432374a |
12 | 27116519a788b |
13 | cb77c7c562c2 |
14 | 59c2a5dc4b91 |
15 | 2a0e70bd3272 |
hex | 15031c22da2b |
23103101131307 has 2 divisors, whose sum is σ = 23103101131308. Its totient is φ = 23103101131306.
The previous prime is 23103101131301. The next prime is 23103101131333. The reversal of 23103101131307 is 70313110130132.
It is a happy number.
It is an a-pointer prime, because the next prime (23103101131333) can be obtained adding 23103101131307 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23103101131307 - 216 = 23103101065771 is a prime.
It is not a weakly prime, because it can be changed into another prime (23103101131301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11551550565653 + 11551550565654.
It is an arithmetic number, because the mean of its divisors is an integer number (11551550565654).
Almost surely, 223103101131307 is an apocalyptic number.
23103101131307 is a deficient number, since it is larger than the sum of its proper divisors (1).
23103101131307 is an equidigital number, since it uses as much as digits as its factorization.
23103101131307 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 26.
Adding to 23103101131307 its reverse (70313110130132), we get a palindrome (93416211261439).
The spelling of 23103101131307 in words is "twenty-three trillion, one hundred three billion, one hundred one million, one hundred thirty-one thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •