Base | Representation |
---|---|
bin | 10101100001101001… |
… | …011111001011000100 |
3 | 2012122210101020101120 |
4 | 111201221133023010 |
5 | 334313423231040 |
6 | 14341253553540 |
7 | 1445523061041 |
oct | 254151371304 |
9 | 65583336346 |
10 | 23113102020 |
11 | 989081a708 |
12 | 45906458b0 |
13 | 224463c438 |
14 | 11939301c8 |
15 | 9042017d0 |
hex | 561a5f2c4 |
23113102020 has 24 divisors (see below), whose sum is σ = 64716685824. Its totient is φ = 6163493856.
The previous prime is 23113102009. The next prime is 23113102031. The reversal of 23113102020 is 2020131132.
It is an interprime number because it is at equal distance from previous prime (23113102009) and next prime (23113102031).
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 7 ways as a sum of consecutive naturals, for example, 192609124 + ... + 192609243.
It is an arithmetic number, because the mean of its divisors is an integer number (2696528576).
Almost surely, 223113102020 is an apocalyptic number.
23113102020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23113102020 is an abundant number, since it is smaller than the sum of its proper divisors (41603583804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23113102020 is a wasteful number, since it uses less digits than its factorization.
23113102020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385218379 (or 385218377 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 23113102020 its reverse (2020131132), we get a palindrome (25133233152).
The spelling of 23113102020 in words is "twenty-three billion, one hundred thirteen million, one hundred two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •