Base | Representation |
---|---|
bin | 10101100000111111… |
… | …001110000110001111 |
3 | 2012122000112022111121 |
4 | 111200333032012033 |
5 | 334303104201111 |
6 | 14340220301411 |
7 | 1445326642624 |
oct | 254077160617 |
9 | 65560468447 |
10 | 23102022031 |
11 | 98855420a0 |
12 | 45889a1867 |
13 | 224226012a |
14 | 119228834b |
15 | 903263871 |
hex | 560fce18f |
23102022031 has 4 divisors (see below), whose sum is σ = 25202205864. Its totient is φ = 21001838200.
The previous prime is 23102022029. The next prime is 23102022091. The reversal of 23102022031 is 13022020132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23102022031 - 21 = 23102022029 is a prime.
It is a super-2 number, since 2×231020220312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23102021996 and 23102022014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23102022091) 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 in 3 ways as a sum of consecutive naturals, for example, 1050091900 + ... + 1050091921.
It is an arithmetic number, because the mean of its divisors is an integer number (6300551466).
Almost surely, 223102022031 is an apocalyptic number.
23102022031 is a deficient number, since it is larger than the sum of its proper divisors (2100183833).
23102022031 is a wasteful number, since it uses less digits than its factorization.
23102022031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2100183832.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 23102022031 its reverse (13022020132), we get a palindrome (36124042163).
The spelling of 23102022031 in words is "twenty-three billion, one hundred two million, twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •