Base | Representation |
---|---|
bin | 10001100110111010110… |
… | …111110101111010101000 |
3 | 11021200021110000012221011 |
4 | 101212322313311322220 |
5 | 124311110334323422 |
6 | 2323513113353304 |
7 | 153264306614614 |
oct | 21467267657250 |
9 | 4250243005834 |
10 | 1210021011112 |
11 | 427192352061 |
12 | 176615708834 |
13 | 8a148750894 |
14 | 427cb39a344 |
15 | 2171e849077 |
hex | 119badf5ea8 |
1210021011112 has 32 divisors (see below), whose sum is σ = 2453359259520. Its totient is φ = 557306295040.
The previous prime is 1210021011103. The next prime is 1210021011113. The reversal of 1210021011112 is 2111101200121.
It is a happy number.
It is a super-3 number, since 3×12100210111123 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210021011092 and 1210021011101.
It is not an unprimeable number, because it can be changed into a prime (1210021011113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 94644814 + ... + 94657597.
It is an arithmetic number, because the mean of its divisors is an integer number (76667476860).
Almost surely, 21210021011112 is an apocalyptic number.
It is an amenable number.
1210021011112 is an abundant number, since it is smaller than the sum of its proper divisors (1243338248408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210021011112 is a wasteful number, since it uses less digits than its factorization.
1210021011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189302481 (or 189302477 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1210021011112 its reverse (2111101200121), we get a palindrome (3321122211233).
The spelling of 1210021011112 in words is "one trillion, two hundred ten billion, twenty-one million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •