Base | Representation |
---|---|
bin | 11001000010001011100011… |
… | …001000000010011111010010 |
3 | 112102211112221011000012201220 |
4 | 121002023203020002133102 |
5 | 103412343323030413132 |
6 | 1030055411355305510 |
7 | 32122351321204146 |
oct | 3102134310023722 |
9 | 472745834005656 |
10 | 110101002201042 |
11 | 32099633462816 |
12 | 1042238aa4b296 |
13 | 495863160bb68 |
14 | 1d28cba123226 |
15 | cadea6915a2c |
hex | 6422e32027d2 |
110101002201042 has 8 divisors (see below), whose sum is σ = 220202004402096. Its totient is φ = 36700334067012.
The previous prime is 110101002201041. The next prime is 110101002201121. The reversal of 110101002201042 is 240102200101011.
It is a sphenic number, since it is the product of 3 distinct primes.
110101002201042 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (110101002201041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9175083516748 + ... + 9175083516759.
It is an arithmetic number, because the mean of its divisors is an integer number (27525250550262).
Almost surely, 2110101002201042 is an apocalyptic number.
110101002201042 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110101002201042 is a wasteful number, since it uses less digits than its factorization.
110101002201042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18350167033512.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110101002201042 its reverse (240102200101011), we get a palindrome (350203202302053).
The spelling of 110101002201042 in words is "one hundred ten trillion, one hundred one billion, two million, two hundred one thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •