Base | Representation |
---|---|
bin | 10001100111000110001… |
… | …101011001001100011011 |
3 | 11021200202200220022202211 |
4 | 101213012031121030123 |
5 | 124312003032210021 |
6 | 2323544030135551 |
7 | 153302106361426 |
oct | 21470615311433 |
9 | 4250680808684 |
10 | 1210211210011 |
11 | 42727a750331 |
12 | 1766693515b7 |
13 | 8a178c859cb |
14 | 4280874a9bd |
15 | 217313b93e1 |
hex | 119c635931b |
1210211210011 has 4 divisors (see below), whose sum is σ = 1210222266472. Its totient is φ = 1210200153552.
The previous prime is 1210211210009. The next prime is 1210211210041. The reversal of 1210211210011 is 1100121120121.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1210211210011 - 21 = 1210211210009 is a prime.
It is a super-2 number, since 2×12102112100112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1210211209973 and 1210211210000.
It is not an unprimeable number, because it can be changed into a prime (1210211210041) 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, 5362386 + ... + 5583511.
It is an arithmetic number, because the mean of its divisors is an integer number (302555566618).
Almost surely, 21210211210011 is an apocalyptic number.
1210211210011 is a deficient number, since it is larger than the sum of its proper divisors (11056461).
1210211210011 is a wasteful number, since it uses less digits than its factorization.
1210211210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11056460.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1210211210011 its reverse (1100121120121), we get a palindrome (2310332330132).
The spelling of 1210211210011 in words is "one trillion, two hundred ten billion, two hundred eleven million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •