Base | Representation |
---|---|
bin | 11001000000111000101010… |
… | …010011101011011000000110 |
3 | 112102112001012120122201020022 |
4 | 121000320222103223120012 |
5 | 103404414040020334342 |
6 | 1025550452134535142 |
7 | 32113050653046605 |
oct | 3100705223533006 |
9 | 472461176581208 |
10 | 110012002121222 |
11 | 32064912210543 |
12 | 10409090b074b2 |
13 | 49501199c9636 |
14 | 1d24875d51a3c |
15 | cab9e82519d2 |
hex | 640e2a4eb606 |
110012002121222 has 8 divisors (see below), whose sum is σ = 165155403687672. Its totient is φ = 54960200892000.
The previous prime is 110012002121221. The next prime is 110012002121237. The reversal of 110012002121222 is 222121200210011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1100120021212222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110012002121222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110012002121221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22900081304 + ... + 22900086107.
It is an arithmetic number, because the mean of its divisors is an integer number (20644425460959).
Almost surely, 2110012002121222 is an apocalyptic number.
110012002121222 is a deficient number, since it is larger than the sum of its proper divisors (55143401566450).
110012002121222 is a wasteful number, since it uses less digits than its factorization.
110012002121222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45800168614.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 110012002121222 its reverse (222121200210011), we get a palindrome (332133202331233).
The spelling of 110012002121222 in words is "one hundred ten trillion, twelve billion, two million, one hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •