Base | Representation |
---|---|
bin | 11011010011110101001010… |
… | …000000100101011111111011 |
3 | 120202021101220120010201021102 |
4 | 123103311022000211133323 |
5 | 111220340241014201334 |
6 | 1103241435003402015 |
7 | 34204442551462535 |
oct | 3323651200453773 |
9 | 522241816121242 |
10 | 120110002100219 |
11 | 352a8402a1923a |
12 | 1157a15882330b |
13 | 520342b1b07c1 |
14 | 21934d863c855 |
15 | dd450ba1567e |
hex | 6d3d4a0257fb |
120110002100219 has 4 divisors (see below), whose sum is σ = 120110144469096. Its totient is φ = 120109859731344.
The previous prime is 120110002100161. The next prime is 120110002100339. The reversal of 120110002100219 is 912001200011021.
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 120110002100219 - 240 = 119010490472443 is a prime.
It is a super-2 number, since 2×1201100021002192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120110002100219.
It is not an unprimeable number, because it can be changed into a prime (120110002100819) 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, 69911369 + ... + 71608794.
It is an arithmetic number, because the mean of its divisors is an integer number (30027536117274).
Almost surely, 2120110002100219 is an apocalyptic number.
120110002100219 is a deficient number, since it is larger than the sum of its proper divisors (142368877).
120110002100219 is an equidigital number, since it uses as much as digits as its factorization.
120110002100219 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142368876.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 120110002100219 in words is "one hundred twenty trillion, one hundred ten billion, two million, one hundred thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •