Base | Representation |
---|---|
bin | 11101011100010001010… |
… | …101011100110011100100 |
3 | 21011102021201012000112210 |
4 | 131130101111130303210 |
5 | 231122023412311400 |
6 | 4145242111243420 |
7 | 266113200630600 |
oct | 35342125346344 |
9 | 7142251160483 |
10 | 2023220432100 |
11 | 71005220913a |
12 | 288144519570 |
13 | 118a341b281a |
14 | 6dcd275c500 |
15 | 37966830950 |
hex | 1d71155cce4 |
2023220432100 has 432 divisors, whose sum is σ = 7361747776320. Its totient is φ = 426267878400.
The previous prime is 2023220432059. The next prime is 2023220432131. The reversal of 2023220432100 is 12340223202.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 10236210 + ... + 10431990.
Almost surely, 22023220432100 is an apocalyptic number.
2023220432100 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 2023220432100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3680873888160).
2023220432100 is an abundant number, since it is smaller than the sum of its proper divisors (5338527344220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2023220432100 is a wasteful number, since it uses less digits than its factorization.
2023220432100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195868 (or 195854 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 2023220432100 its reverse (12340223202), we get a palindrome (2035560655302).
The spelling of 2023220432100 in words is "two trillion, twenty-three billion, two hundred twenty million, four hundred thirty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •