Base | Representation |
---|---|
bin | 1010100000010111011000… |
… | …11001001000101101010100 |
3 | 10000210120002000110211201110 |
4 | 11100023230121020231110 |
5 | 11012002002313131012 |
6 | 121045014500255020 |
7 | 4603041351030156 |
oct | 520135431105524 |
9 | 100716060424643 |
10 | 23102300130132 |
11 | 73a76a3169703 |
12 | 27114696a1470 |
13 | cb76cb012802 |
14 | 59c22b878ad6 |
15 | 2a0e2570e73c |
hex | 1502ec648b54 |
23102300130132 has 48 divisors (see below), whose sum is σ = 55159545272832. Its totient is φ = 7521602051040.
The previous prime is 23102300130083. The next prime is 23102300130167. The reversal of 23102300130132 is 23103100320132.
It is a junction number, because it is equal to n+sod(n) for n = 23102300130099 and 23102300130108.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 72528457 + ... + 72846287.
It is an arithmetic number, because the mean of its divisors is an integer number (1149157193184).
Almost surely, 223102300130132 is an apocalyptic number.
It is an amenable number.
23102300130132 is an abundant number, since it is smaller than the sum of its proper divisors (32057245142700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23102300130132 is a wasteful number, since it uses less digits than its factorization.
23102300130132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 458748 (or 458746 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 23102300130132 its reverse (23103100320132), we get a palindrome (46205400450264).
The spelling of 23102300130132 in words is "twenty-three trillion, one hundred two billion, three hundred million, one hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •