Base | Representation |
---|---|
bin | 10101011011100000… |
… | …100100010001001100 |
3 | 2012101121120012121001 |
4 | 111123200210101030 |
5 | 334111041202200 |
6 | 14323134150044 |
7 | 1443132424345 |
oct | 253340442114 |
9 | 65347505531 |
10 | 23010100300 |
11 | 9838668a20 |
12 | 4562052324 |
13 | 22291b7585 |
14 | 1183d9b0cc |
15 | 8ea15776a |
hex | 55b82444c |
23010100300 has 144 divisors (see below), whose sum is σ = 57186339840. Its totient is φ = 7959456000.
The previous prime is 23010100279. The next prime is 23010100349. The reversal of 23010100300 is 300101032.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2006182 + ... + 2017618.
It is an arithmetic number, because the mean of its divisors is an integer number (397127360).
Almost surely, 223010100300 is an apocalyptic number.
23010100300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23010100300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28593169920).
23010100300 is an abundant number, since it is smaller than the sum of its proper divisors (34176239540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23010100300 is a wasteful number, since it uses less digits than its factorization.
23010100300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11552 (or 11545 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 23010100300 its reverse (300101032), we get a palindrome (23310201332).
The spelling of 23010100300 in words is "twenty-three billion, ten million, one hundred thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •