Base | Representation |
---|---|
bin | 11001000011111010101001… |
… | …111001101101111110111101 |
3 | 112110020221212022011210202101 |
4 | 121003322221321231332331 |
5 | 103421322134103330023 |
6 | 1030230301331425101 |
7 | 32134103546212222 |
oct | 3103725171557675 |
9 | 473227768153671 |
10 | 110220301230013 |
11 | 32135192674a37 |
12 | 10441523a55191 |
13 | 4966964506b70 |
14 | 1d3099631b949 |
15 | cb213a0a61ad |
hex | 643ea9e6dfbd |
110220301230013 has 16 divisors (see below), whose sum is σ = 118979311461696. Its totient is φ = 101501391340800.
The previous prime is 110220301229999. The next prime is 110220301230019. The reversal of 110220301230013 is 310032103022011.
It is a cyclic number.
It is not a de Polignac number, because 110220301230013 - 29 = 110220301229501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110220301230019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 106135938 + ... + 107169388.
It is an arithmetic number, because the mean of its divisors is an integer number (7436206966356).
Almost surely, 2110220301230013 is an apocalyptic number.
110220301230013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
110220301230013 is a deficient number, since it is larger than the sum of its proper divisors (8759010231683).
110220301230013 is a wasteful number, since it uses less digits than its factorization.
110220301230013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1052844.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 110220301230013 its reverse (310032103022011), we get a palindrome (420252404252024).
The spelling of 110220301230013 in words is "one hundred ten trillion, two hundred twenty billion, three hundred one million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •