Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …010010111010111000011100 |
3 | 112102211200001112100211111222 |
4 | 121002030223102322320130 |
5 | 103412403313012404040 |
6 | 1030100131451232512 |
7 | 32122423323013214 |
oct | 3102145322727034 |
9 | 472750045324458 |
10 | 110102213013020 |
11 | 3209a0a4983778 |
12 | 10422668448738 |
13 | 495879541a657 |
14 | 1d28d92c69244 |
15 | cae027d89bb5 |
hex | 64232b4bae1c |
110102213013020 has 24 divisors (see below), whose sum is σ = 231215798433984. Its totient is φ = 44040665946816.
The previous prime is 110102213013011. The next prime is 110102213013047. The reversal of 110102213013020 is 20310312201011.
It is a self number, because there is not a number n which added to its sum of digits gives 110102213013020.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9555332 + ... + 17649611.
It is an arithmetic number, because the mean of its divisors is an integer number (9633991601416).
Almost surely, 2110102213013020 is an apocalyptic number.
110102213013020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110102213013020 is an abundant number, since it is smaller than the sum of its proper divisors (121113585420964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110102213013020 is a wasteful number, since it uses less digits than its factorization.
110102213013020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27407309 (or 27407307 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 110102213013020 its reverse (20310312201011), we get a palindrome (130412525214031).
The spelling of 110102213013020 in words is "one hundred ten trillion, one hundred two billion, two hundred thirteen million, thirteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •