Base | Representation |
---|---|
bin | 10101101110000010… |
… | …100110101110001100 |
3 | 2020012021121012211010 |
4 | 111232002212232030 |
5 | 340230134410012 |
6 | 14414042125220 |
7 | 1453626224634 |
oct | 255602465614 |
9 | 66167535733 |
10 | 23321013132 |
11 | 998811637a |
12 | 462a1b0810 |
13 | 2278736571 |
14 | 11b33b16c4 |
15 | 9175bec3c |
hex | 56e0a6b8c |
23321013132 has 12 divisors (see below), whose sum is σ = 54415697336. Its totient is φ = 7773671040.
The previous prime is 23321013127. The next prime is 23321013137. The reversal of 23321013132 is 23131012332.
It is an interprime number because it is at equal distance from previous prime (23321013127) and next prime (23321013137).
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 23321013099 and 23321013108.
It is not an unprimeable number, because it can be changed into a prime (23321013137) 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 3 ways as a sum of consecutive naturals, for example, 971708869 + ... + 971708892.
Almost surely, 223321013132 is an apocalyptic number.
It is an amenable number.
23321013132 is an abundant number, since it is smaller than the sum of its proper divisors (31094684204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23321013132 is a wasteful number, since it uses less digits than its factorization.
23321013132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1943417768 (or 1943417766 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23321013132 its reverse (23131012332), we get a palindrome (46452025464).
The spelling of 23321013132 in words is "twenty-three billion, three hundred twenty-one million, thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •