Base | Representation |
---|---|
bin | 1010011101101100000001… |
… | …10000111000100101101100 |
3 | 10000110202121101012020011220 |
4 | 11032312000300320211230 |
5 | 11004000043311244040 |
6 | 120534441432343340 |
7 | 4563303454506606 |
oct | 516660060704554 |
9 | 100422541166156 |
10 | 23010300103020 |
11 | 737168259264a |
12 | 26b7672b44b50 |
13 | cabb28a36a49 |
14 | 5979c10b6176 |
15 | 29d83d9b72d0 |
hex | 14ed80c3896c |
23010300103020 has 48 divisors (see below), whose sum is σ = 64591129625568. Its totient is φ = 6120623900160.
The previous prime is 23010300102961. The next prime is 23010300103033. The reversal of 23010300103020 is 2030100301032.
It is a super-2 number, since 2×230103001030202 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 482979961 + ... + 483027600.
It is an arithmetic number, because the mean of its divisors is an integer number (1345648533866).
Almost surely, 223010300103020 is an apocalyptic number.
23010300103020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23010300103020 is an abundant number, since it is smaller than the sum of its proper divisors (41580829522548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23010300103020 is a wasteful number, since it uses less digits than its factorization.
23010300103020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 966007970 (or 966007968 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 23010300103020 its reverse (2030100301032), we get a palindrome (25040400404052).
The spelling of 23010300103020 in words is "twenty-three trillion, ten billion, three hundred million, one hundred three thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •