Base | Representation |
---|---|
bin | 10101101101011001… |
… | …110010001011000100 |
3 | 2020011112110112210210 |
4 | 111231121302023010 |
5 | 340214414442012 |
6 | 14413020515420 |
7 | 1453436245452 |
oct | 255531621304 |
9 | 66145415723 |
10 | 23310312132 |
11 | 9982077578 |
12 | 46266abb70 |
13 | 227645a903 |
14 | 11b1bc79d2 |
15 | 9166a923c |
hex | 56d6722c4 |
23310312132 has 48 divisors (see below), whose sum is σ = 55885152960. Its totient is φ = 7556798592.
The previous prime is 23310312131. The next prime is 23310312133. The reversal of 23310312132 is 23121301332.
It is an interprime number because it is at equal distance from previous prime (23310312131) and next prime (23310312133).
It is a junction number, because it is equal to n+sod(n) for n = 23310312099 and 23310312108.
It is not an unprimeable number, because it can be changed into a prime (23310312131) 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 in 15 ways as a sum of consecutive naturals, for example, 1134898 + ... + 1155254.
It is an arithmetic number, because the mean of its divisors is an integer number (1164274020).
Almost surely, 223310312132 is an apocalyptic number.
It is an amenable number.
23310312132 is an abundant number, since it is smaller than the sum of its proper divisors (32574840828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23310312132 is a wasteful number, since it uses less digits than its factorization.
23310312132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22980 (or 22978 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23310312132 its reverse (23121301332), we get a palindrome (46431613464).
The spelling of 23310312132 in words is "twenty-three billion, three hundred ten million, three hundred twelve thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •