Base | Representation |
---|---|
bin | 10101100011010001… |
… | …011111001000001101 |
3 | 2012201200200022220122 |
4 | 111203101133020031 |
5 | 334342413133223 |
6 | 14344110154325 |
7 | 1446303566306 |
oct | 254321371015 |
9 | 65650608818 |
10 | 23140364813 |
11 | 98a5150645 |
12 | 45997b29a5 |
13 | 224a196577 |
14 | 11973c97ad |
15 | 9067d95c8 |
hex | 56345f20d |
23140364813 has 2 divisors, whose sum is σ = 23140364814. Its totient is φ = 23140364812.
The previous prime is 23140364729. The next prime is 23140364831. The reversal of 23140364813 is 31846304132.
Together with next prime (23140364831) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21856074244 + 1284290569 = 147838^2 + 35837^2 .
It is a cyclic number.
It is not a de Polignac number, because 23140364813 - 28 = 23140364557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23140364713) 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, 11570182406 + 11570182407.
It is an arithmetic number, because the mean of its divisors is an integer number (11570182407).
Almost surely, 223140364813 is an apocalyptic number.
It is an amenable number.
23140364813 is a deficient number, since it is larger than the sum of its proper divisors (1).
23140364813 is an equidigital number, since it uses as much as digits as its factorization.
23140364813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
Adding to 23140364813 its reverse (31846304132), we get a palindrome (54986668945).
The spelling of 23140364813 in words is "twenty-three billion, one hundred forty million, three hundred sixty-four thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.248 sec. • engine limits •