Base | Representation |
---|---|
bin | 1010000000110111111001… |
… | …1010101101010010010110 |
3 | 1102222120001100012011000011 |
4 | 2200031332122231102112 |
5 | 2420342212230010402 |
6 | 35225551423310434 |
7 | 2214312042535363 |
oct | 240157632552226 |
9 | 42876040164004 |
10 | 11010122110102 |
11 | 3565403997065 |
12 | 1299a0374b41a |
13 | 61b3334c6a0b |
14 | 2a0c6da0346a |
15 | 1415ea137ed7 |
hex | a037e6ad496 |
11010122110102 has 8 divisors (see below), whose sum is σ = 17384403331800. Its totient is φ = 5215320999504.
The previous prime is 11010122110087. The next prime is 11010122110109. The reversal of 11010122110102 is 20101122101011.
It is a happy number.
11010122110102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010122110109) 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, 144870027727 + ... + 144870027802.
It is an arithmetic number, because the mean of its divisors is an integer number (2173050416475).
Almost surely, 211010122110102 is an apocalyptic number.
11010122110102 is a deficient number, since it is larger than the sum of its proper divisors (6374281221698).
11010122110102 is a wasteful number, since it uses less digits than its factorization.
11010122110102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289740055550.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11010122110102 its reverse (20101122101011), we get a palindrome (31111244211113).
Subtracting 11010122110102 from its reverse (20101122101011), we obtain a palindrome (9090999990909).
The spelling of 11010122110102 in words is "eleven trillion, ten billion, one hundred twenty-two million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •