Base | Representation |
---|---|
bin | 11001000000111001100110… |
… | …011101011001011010001110 |
3 | 112102112010210220121102001021 |
4 | 121000321212131121122032 |
5 | 103404423121343131110 |
6 | 1025551140225104354 |
7 | 32113114655665654 |
oct | 3100714635313216 |
9 | 472463726542037 |
10 | 110013011302030 |
11 | 3206528a934a71 |
12 | 10409312a880ba |
13 | 495024aacc545 |
14 | 1d2492ddacdd4 |
15 | caba56b482da |
hex | 640e6675968e |
110013011302030 has 32 divisors (see below), whose sum is σ = 199895467543200. Its totient is φ = 43589417542272.
The previous prime is 110013011302009. The next prime is 110013011302031. The reversal of 110013011302030 is 30203110310011.
It is a junction number, because it is equal to n+sod(n) for n = 110013011301995 and 110013011302013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110013011302031) 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, 10029360 + ... + 17905699.
It is an arithmetic number, because the mean of its divisors is an integer number (6246733360725).
Almost surely, 2110013011302030 is an apocalyptic number.
110013011302030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110013011302030 is a deficient number, since it is larger than the sum of its proper divisors (89882456241170).
110013011302030 is a wasteful number, since it uses less digits than its factorization.
110013011302030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27938788.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 110013011302030 its reverse (30203110310011), we get a palindrome (140216121612041).
The spelling of 110013011302030 in words is "one hundred ten trillion, thirteen billion, eleven million, three hundred two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •