Base | Representation |
---|---|
bin | 11001000010011111000110… |
… | …110000011111010010110010 |
3 | 112102220120010121010220111111 |
4 | 121002133012300133102302 |
5 | 103413214324240231002 |
6 | 1030113203210503534 |
7 | 32124023563003561 |
oct | 3102370660372262 |
9 | 472816117126444 |
10 | 110122001102002 |
11 | 320a752982491a |
12 | 1042646b434baa |
13 | 495a5c9c2a646 |
14 | 1d29d0cd4bbd8 |
15 | cae7d51e73d7 |
hex | 6427c6c1f4b2 |
110122001102002 has 96 divisors (see below), whose sum is σ = 181494981089280. Its totient is φ = 49930290708480.
The previous prime is 110122001101969. The next prime is 110122001102111. The reversal of 110122001102002 is 200201100221011.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 5726265727 + ... + 5726284957.
It is an arithmetic number, because the mean of its divisors is an integer number (1890572719680).
Almost surely, 2110122001102002 is an apocalyptic number.
110122001102002 is a deficient number, since it is larger than the sum of its proper divisors (71372979987278).
110122001102002 is a wasteful number, since it uses less digits than its factorization.
110122001102002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20568 (or 20525 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110122001102002 its reverse (200201100221011), we get a palindrome (310323101323013).
The spelling of 110122001102002 in words is "one hundred ten trillion, one hundred twenty-two billion, one million, one hundred two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •