Base | Representation |
---|---|
bin | 1010000000110111111001… |
… | …0011011101011011001001 |
3 | 1102222120001012121121201111 |
4 | 2200031332103131123021 |
5 | 2420342211233210441 |
6 | 35225551314450321 |
7 | 2214312020433154 |
oct | 240157623353311 |
9 | 42876035547644 |
10 | 11010120210121 |
11 | 356540290962a |
12 | 1299a02b939a1 |
13 | 61b332cacc76 |
14 | 2a0c6d66ac9b |
15 | 1415e9db0081 |
hex | a037e4dd6c9 |
11010120210121 has 8 divisors (see below), whose sum is σ = 11667382776000. Its totient is φ = 10360635899760.
The previous prime is 11010120210107. The next prime is 11010120210149. The reversal of 11010120210121 is 12101202101011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11010120210121 - 27 = 11010120209993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11010120210151) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1944560965 + ... + 1944566626.
It is an arithmetic number, because the mean of its divisors is an integer number (1458422847000).
Almost surely, 211010120210121 is an apocalyptic number.
It is an amenable number.
11010120210121 is a deficient number, since it is larger than the sum of its proper divisors (657262565879).
11010120210121 is a wasteful number, since it uses less digits than its factorization.
11010120210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3889127759.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11010120210121 its reverse (12101202101011), we get a palindrome (23111322311132).
The spelling of 11010120210121 in words is "eleven trillion, ten billion, one hundred twenty million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •