Base | Representation |
---|---|
bin | 1010100000010100111111… |
… | …00011111000001001000110 |
3 | 10000210102202011221100010020 |
4 | 11100022133203320021012 |
5 | 11011441332320201410 |
6 | 121044242532040010 |
7 | 4602664406326410 |
oct | 520123743701106 |
9 | 100712664840106 |
10 | 23101011100230 |
11 | 73a70a1584438 |
12 | 2711169a63006 |
13 | cb7553c48b1b |
14 | 59c1485b19b0 |
15 | 2a0d9c489a70 |
hex | 15029f8f8246 |
23101011100230 has 128 divisors (see below), whose sum is σ = 63769426329600. Its totient is φ = 5246426989440.
The previous prime is 23101011100151. The next prime is 23101011100247. The reversal of 23101011100230 is 3200111010132.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 26106507 + ... + 26976873.
It is an arithmetic number, because the mean of its divisors is an integer number (498198643200).
Almost surely, 223101011100230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23101011100230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31884713164800).
23101011100230 is an abundant number, since it is smaller than the sum of its proper divisors (40668415229370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23101011100230 is a wasteful number, since it uses less digits than its factorization.
23101011100230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 871194.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 23101011100230 its reverse (3200111010132), we get a palindrome (26301122110362).
The spelling of 23101011100230 in words is "twenty-three trillion, one hundred one billion, eleven million, one hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •