Base | Representation |
---|---|
bin | 11001000000111001101011… |
… | …110111011000111111001010 |
3 | 112102112011001020021110011221 |
4 | 121000321223313120333022 |
5 | 103404423313103031442 |
6 | 1025551153225112254 |
7 | 32113120136635504 |
oct | 3100715367307712 |
9 | 472464036243157 |
10 | 110013102002122 |
11 | 32065327054320 |
12 | 1040933932868a |
13 | 4950263838037 |
14 | 1d2493c05cd74 |
15 | caba5eab2467 |
hex | 640e6bdd8fca |
110013102002122 has 8 divisors (see below), whose sum is σ = 180021439639872. Its totient is φ = 50005955455500.
The previous prime is 110013102002113. The next prime is 110013102002189. The reversal of 110013102002122 is 221200201310011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1100131020021222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110013102002096 and 110013102002105.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2500297772754 + ... + 2500297772797.
It is an arithmetic number, because the mean of its divisors is an integer number (22502679954984).
Almost surely, 2110013102002122 is an apocalyptic number.
110013102002122 is a deficient number, since it is larger than the sum of its proper divisors (70008337637750).
110013102002122 is a wasteful number, since it uses less digits than its factorization.
110013102002122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5000595545564.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 110013102002122 its reverse (221200201310011), we get a palindrome (331213303312133).
The spelling of 110013102002122 in words is "one hundred ten trillion, thirteen billion, one hundred two million, two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •