Base | Representation |
---|---|
bin | 1010000000110111111001… |
… | …0011011101011001100110 |
3 | 1102222120001012121121120211 |
4 | 2200031332103131121212 |
5 | 2420342211233210042 |
6 | 35225551314450034 |
7 | 2214312020432653 |
oct | 240157623353146 |
9 | 42876035547524 |
10 | 11010120210022 |
11 | 356540290954a |
12 | 1299a02b9391a |
13 | 61b332cacbcb |
14 | 2a0c6d66ac2a |
15 | 1415e9db0017 |
hex | a037e4dd666 |
11010120210022 has 8 divisors (see below), whose sum is σ = 16568975691576. Its totient is φ = 5487128312832.
The previous prime is 11010120209993. The next prime is 11010120210043. The reversal of 11010120210022 is 22001202101011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11010120209984 and 11010120210011.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 8965895323 + ... + 8965896550.
It is an arithmetic number, because the mean of its divisors is an integer number (2071121961447).
Almost surely, 211010120210022 is an apocalyptic number.
11010120210022 is a deficient number, since it is larger than the sum of its proper divisors (5558855481554).
11010120210022 is a wasteful number, since it uses less digits than its factorization.
11010120210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17931792182.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11010120210022 its reverse (22001202101011), we get a palindrome (33011322311033).
The spelling of 11010120210022 in words is "eleven trillion, ten billion, one hundred twenty million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •