Base | Representation |
---|---|
bin | 1010100100101010111001… |
… | …00100011100101111101010 |
3 | 10001022200212011221011202200 |
4 | 11102111130210130233222 |
5 | 11021412413011011132 |
6 | 121240555520241030 |
7 | 4616525621661351 |
oct | 522253444345752 |
9 | 101280764834680 |
10 | 23250211032042 |
11 | 74543a4aa5505 |
12 | 2736068770176 |
13 | cc8640820347 |
14 | 5a545d9ba998 |
15 | 2a4bd0bcbd7c |
hex | 15255c91cbea |
23250211032042 has 96 divisors (see below), whose sum is σ = 52157852398080. Its totient is φ = 7476324105600.
The previous prime is 23250211032031. The next prime is 23250211032073. The reversal of 23250211032042 is 24023011205232.
23250211032042 is a `hidden beast` number, since 2 + 3 + 2 + 502 + 110 + 3 + 2 + 0 + 42 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 23250211031997 and 23250211032015.
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 47 ways as a sum of consecutive naturals, for example, 4713196608 + ... + 4713201540.
It is an arithmetic number, because the mean of its divisors is an integer number (543310962480).
Almost surely, 223250211032042 is an apocalyptic number.
23250211032042 is an abundant number, since it is smaller than the sum of its proper divisors (28907641366038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23250211032042 is a wasteful number, since it uses less digits than its factorization.
23250211032042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10988 (or 10985 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 23250211032042 its reverse (24023011205232), we get a palindrome (47273222237274).
The spelling of 23250211032042 in words is "twenty-three trillion, two hundred fifty billion, two hundred eleven million, thirty-two thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •