Base | Representation |
---|---|
bin | 10101100111011011… |
… | …100000110100001111 |
3 | 2012220112220100101120 |
4 | 111213123200310033 |
5 | 340013241231111 |
6 | 14355041012023 |
7 | 1451111416644 |
oct | 254733406417 |
9 | 65815810346 |
10 | 23210102031 |
11 | 9930552206 |
12 | 45b9024013 |
13 | 225b7725ac |
14 | 11a277ddcb |
15 | 90c9b2406 |
hex | 5676e0d0f |
23210102031 has 8 divisors (see below), whose sum is σ = 31018275120. Its totient is φ = 15437665152.
The previous prime is 23210101991. The next prime is 23210102077. The reversal of 23210102031 is 13020101232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23210102031 - 215 = 23210069263 is a prime.
It is a super-2 number, since 2×232101020312 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23210102031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23210102081) 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 7 ways as a sum of consecutive naturals, for example, 8932536 + ... + 8935133.
It is an arithmetic number, because the mean of its divisors is an integer number (3877284390).
Almost surely, 223210102031 is an apocalyptic number.
23210102031 is a deficient number, since it is larger than the sum of its proper divisors (7808173089).
23210102031 is a wasteful number, since it uses less digits than its factorization.
23210102031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17868105.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 23210102031 its reverse (13020101232), we get a palindrome (36230203263).
The spelling of 23210102031 in words is "twenty-three billion, two hundred ten million, one hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •