Base | Representation |
---|---|
bin | 1010011110010101000001… |
… | …01110001110010110100000 |
3 | 10000112212102100210101200012 |
4 | 11033022200232032112200 |
5 | 11004330133121104440 |
6 | 120552521520544052 |
7 | 4565013066142661 |
oct | 517124056162640 |
9 | 100485370711605 |
10 | 23032311113120 |
11 | 737aa48199291 |
12 | 26bb996482028 |
13 | cb0c25c4228a |
14 | 598aac4c1368 |
15 | 29e1cb06ce65 |
hex | 14f2a0b8e5a0 |
23032311113120 has 24 divisors (see below), whose sum is σ = 54413835005124. Its totient is φ = 9212924445184.
The previous prime is 23032311113107. The next prime is 23032311113131. The reversal of 23032311113120 is 2131111323032.
It can be written as a sum of positive squares in 2 ways, for example, as 23030823313936 + 1487799184 = 4799044^2 + 38572^2 .
It is a super-2 number, since 2×230323111131202 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71975972069 + ... + 71975972388.
Almost surely, 223032311113120 is an apocalyptic number.
23032311113120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23032311113120 is an abundant number, since it is smaller than the sum of its proper divisors (31381523892004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23032311113120 is a wasteful number, since it uses less digits than its factorization.
23032311113120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143951944472 (or 143951944464 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 23032311113120 its reverse (2131111323032), we get a palindrome (25163422436152).
The spelling of 23032311113120 in words is "twenty-three trillion, thirty-two billion, three hundred eleven million, one hundred thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •