Base | Representation |
---|---|
bin | 10001101000000001101… |
… | …111011110011011110111 |
3 | 11021210100022022010020001 |
4 | 101220001233132123313 |
5 | 124321024230000434 |
6 | 2324231105452131 |
7 | 153335625063100 |
oct | 21500157363367 |
9 | 4253308263201 |
10 | 1211210000119 |
11 | 4277425180a9 |
12 | 1768a7941047 |
13 | 8a2a7b8b282 |
14 | 428a12613a7 |
15 | 2178de0c114 |
hex | 11a01bde6f7 |
1211210000119 has 24 divisors (see below), whose sum is σ = 1484774389728. Its totient is φ = 983209550400.
The previous prime is 1211210000107. The next prime is 1211210000149. The reversal of 1211210000119 is 9110000121121.
It is not a de Polignac number, because 1211210000119 - 29 = 1211209999607 is a prime.
It is a super-2 number, since 2×12112100001192 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1211210000096 and 1211210000105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211210000149) 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 23 ways as a sum of consecutive naturals, for example, 5206572 + ... + 5434225.
It is an arithmetic number, because the mean of its divisors is an integer number (61865599572).
Almost surely, 21211210000119 is an apocalyptic number.
1211210000119 is a deficient number, since it is larger than the sum of its proper divisors (273564389609).
1211210000119 is a wasteful number, since it uses less digits than its factorization.
1211210000119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10640935 (or 10640928 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 19.
The spelling of 1211210000119 in words is "one trillion, two hundred eleven billion, two hundred ten million, one hundred nineteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •