Base | Representation |
---|---|
bin | 11001000000111001100110… |
… | …011101011001011101000101 |
3 | 112102112010210220121102022001 |
4 | 121000321212131121131011 |
5 | 103404423121343132323 |
6 | 1025551140225105301 |
7 | 32113114655666335 |
oct | 3100714635313505 |
9 | 472463726542261 |
10 | 110013011302213 |
11 | 3206528a935118 |
12 | 10409312a88231 |
13 | 495024aacc656 |
14 | 1d2492ddad0c5 |
15 | caba56b483ad |
hex | 640e66759745 |
110013011302213 has 16 divisors (see below), whose sum is σ = 113963509895040. Its totient is φ = 106150625570304.
The previous prime is 110013011302177. The next prime is 110013011302273. The reversal of 110013011302213 is 312203110310011.
It is a cyclic number.
It is not a de Polignac number, because 110013011302213 - 29 = 110013011301701 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 (110013011302273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79415856 + ... + 80789257.
It is an arithmetic number, because the mean of its divisors is an integer number (7122719368440).
Almost surely, 2110013011302213 is an apocalyptic number.
It is an amenable number.
110013011302213 is a deficient number, since it is larger than the sum of its proper divisors (3950498592827).
110013011302213 is a wasteful number, since it uses less digits than its factorization.
110013011302213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160205388.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 110013011302213 its reverse (312203110310011), we get a palindrome (422216121612224).
The spelling of 110013011302213 in words is "one hundred ten trillion, thirteen billion, eleven million, three hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •