Base | Representation |
---|---|
bin | 10101011010111110… |
… | …011001001100000100 |
3 | 2012100222201002010220 |
4 | 111122332121030010 |
5 | 334101243021040 |
6 | 14322214144340 |
7 | 1442663324043 |
oct | 253276311404 |
9 | 65328632126 |
10 | 23001142020 |
11 | 98335aa48a |
12 | 455b0520b0 |
13 | 222739bc0c |
14 | 1182b0855a |
15 | 8e94882d0 |
hex | 55af99304 |
23001142020 has 48 divisors (see below), whose sum is σ = 64477969920. Its totient is φ = 6126516736.
The previous prime is 23001142007. The next prime is 23001142033. The reversal of 23001142020 is 2024110032.
It is an interprime number because it is at equal distance from previous prime (23001142007) and next prime (23001142033).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 170325 + ... + 273884.
It is an arithmetic number, because the mean of its divisors is an integer number (1343291040).
Almost surely, 223001142020 is an apocalyptic number.
23001142020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23001142020 is an abundant number, since it is smaller than the sum of its proper divisors (41476827900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23001142020 is a wasteful number, since it uses less digits than its factorization.
23001142020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445084 (or 445082 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 23001142020 its reverse (2024110032), we get a palindrome (25025252052).
The spelling of 23001142020 in words is "twenty-three billion, one million, one hundred forty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •