Base | Representation |
---|---|
bin | 10001100111000000001… |
… | …011110001000010111001 |
3 | 11021200111122200102111211 |
4 | 101213000023301002321 |
5 | 124311301142320441 |
6 | 2323530015323121 |
7 | 153266441206630 |
oct | 21470013610271 |
9 | 4250448612454 |
10 | 1210110120121 |
11 | 427228684a71 |
12 | 17663b5204a1 |
13 | 8a1610500c6 |
14 | 427d9154517 |
15 | 2172759ba81 |
hex | 119c02f10b9 |
1210110120121 has 16 divisors (see below), whose sum is σ = 1415051827200. Its totient is φ = 1013401333008.
The previous prime is 1210110120113. The next prime is 1210110120127. The reversal of 1210110120121 is 1210210110121.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1210110120121 - 23 = 1210110120113 is a prime.
It is a super-2 number, since 2×12101101201212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1210110120127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8920561 + ... + 9055198.
It is an arithmetic number, because the mean of its divisors is an integer number (88440739200).
Almost surely, 21210110120121 is an apocalyptic number.
It is an amenable number.
1210110120121 is a deficient number, since it is larger than the sum of its proper divisors (204941707079).
1210110120121 is a wasteful number, since it uses less digits than its factorization.
1210110120121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17975988.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1210110120121 its reverse (1210210110121), we get a palindrome (2420320230242).
The spelling of 1210110120121 in words is "one trillion, two hundred ten billion, one hundred ten million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •