Base | Representation |
---|---|
bin | 10101011110000100… |
… | …010000100100101000 |
3 | 2012111121022022100010 |
4 | 111132010100210220 |
5 | 334203032324430 |
6 | 14331310011520 |
7 | 1444163235210 |
oct | 253604204450 |
9 | 65447268303 |
10 | 23053011240 |
11 | 985a907606 |
12 | 45744a6ba0 |
13 | 223506006c |
14 | 118996b240 |
15 | 8edcd1cb0 |
hex | 55e110928 |
23053011240 has 64 divisors (see below), whose sum is σ = 79038898560. Its totient is φ = 5269259520.
The previous prime is 23053011227. The next prime is 23053011253. The reversal of 23053011240 is 4211035032.
It is an interprime number because it is at equal distance from previous prime (23053011227) and next prime (23053011253).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13721191 + ... + 13722870.
It is an arithmetic number, because the mean of its divisors is an integer number (1234982790).
Almost surely, 223053011240 is an apocalyptic number.
23053011240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23053011240 is an abundant number, since it is smaller than the sum of its proper divisors (55985887320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23053011240 is a wasteful number, since it uses less digits than its factorization.
23053011240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27444082 (or 27444078 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 23053011240 its reverse (4211035032), we get a palindrome (27264046272).
The spelling of 23053011240 in words is "twenty-three billion, fifty-three million, eleven thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •