Base | Representation |
---|---|
bin | 11001000011111010011000… |
… | …000100101000011100010100 |
3 | 112110020221002110022110220111 |
4 | 121003322120010220130110 |
5 | 103421321031014213022 |
6 | 1030230211524212404 |
7 | 32134063254521056 |
oct | 3103723004503424 |
9 | 473227073273814 |
10 | 110220002101012 |
11 | 32135049835991 |
12 | 1044145b83a104 |
13 | 496691755265b |
14 | 1d309686d38d6 |
15 | cb211dbba477 |
hex | 643e98128714 |
110220002101012 has 12 divisors (see below), whose sum is σ = 193692053903040. Its totient is φ = 54879415271576.
The previous prime is 110220002100979. The next prime is 110220002101063. The reversal of 110220002101012 is 210101200022011.
It is a junction number, because it is equal to n+sod(n) for n = 110220002100983 and 110220002101001.
It is a congruent number.
It is an unprimeable number.
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, 57646443658 + ... + 57646445569.
It is an arithmetic number, because the mean of its divisors is an integer number (16141004491920).
Almost surely, 2110220002101012 is an apocalyptic number.
It is an amenable number.
110220002101012 is a deficient number, since it is larger than the sum of its proper divisors (83472051802028).
110220002101012 is a wasteful number, since it uses less digits than its factorization.
110220002101012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115292889470 (or 115292889468 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110220002101012 its reverse (210101200022011), we get a palindrome (320321202123023).
The spelling of 110220002101012 in words is "one hundred ten trillion, two hundred twenty billion, two million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •