Base | Representation |
---|---|
bin | 1010100001001111100010… |
… | …11101111101100000111000 |
3 | 10000220102220012212120102222 |
4 | 11100213301131331200320 |
5 | 11013000224203132102 |
6 | 121110522325543212 |
7 | 4605156451112360 |
oct | 520476135754070 |
9 | 100812805776388 |
10 | 23132450052152 |
11 | 7409464aa1331 |
12 | 2717282874b08 |
13 | cba4c447a15c |
14 | 59d88bb8b9a0 |
15 | 2a1adc59eaa2 |
hex | 1509f177d838 |
23132450052152 has 16 divisors (see below), whose sum is σ = 49569535826160. Its totient is φ = 9913907165184.
The previous prime is 23132450052133. The next prime is 23132450052163. The reversal of 23132450052152 is 25125005423132.
It is a super-2 number, since 2×231324500521522 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 206539732553 + ... + 206539732664.
It is an arithmetic number, because the mean of its divisors is an integer number (3098095989135).
Almost surely, 223132450052152 is an apocalyptic number.
It is an amenable number.
23132450052152 is an abundant number, since it is smaller than the sum of its proper divisors (26437085774008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23132450052152 is a wasteful number, since it uses less digits than its factorization.
23132450052152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413079465230 (or 413079465226 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 35.
Adding to 23132450052152 its reverse (25125005423132), we get a palindrome (48257455475284).
The spelling of 23132450052152 in words is "twenty-three trillion, one hundred thirty-two billion, four hundred fifty million, fifty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •