Base | Representation |
---|---|
bin | 11001000001000000001101… |
… | …000010100001110101011110 |
3 | 112102112211010000011110011011 |
4 | 121001000031002201311132 |
5 | 103410032131330133042 |
6 | 1025554311530245434 |
7 | 32113455444420433 |
oct | 3101001502416536 |
9 | 472484100143134 |
10 | 110020101021022 |
11 | 32068298898865 |
12 | 1040a77128687a |
13 | 4950b0a88953a |
14 | 1d25003801b8a |
15 | cabd1e285a17 |
hex | 64100d0a1d5e |
110020101021022 has 8 divisors (see below), whose sum is σ = 165030200343072. Its totient is φ = 55010034240000.
The previous prime is 110020101020959. The next prime is 110020101021023. The reversal of 110020101021022 is 220120101020011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×1100201010210223 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 110020101020993 and 110020101021011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110020101021023) 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, 3846622 + ... + 15324382.
It is an arithmetic number, because the mean of its divisors is an integer number (20628775042884).
Almost surely, 2110020101021022 is an apocalyptic number.
110020101021022 is a deficient number, since it is larger than the sum of its proper divisors (55010099322050).
110020101021022 is a wasteful number, since it uses less digits than its factorization.
110020101021022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16270514.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110020101021022 its reverse (220120101020011), we get a palindrome (330140202041033).
The spelling of 110020101021022 in words is "one hundred ten trillion, twenty billion, one hundred one million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •