Base | Representation |
---|---|
bin | 10001100111110101010… |
… | …010010010011010100111 |
3 | 11021202210202001221022010 |
4 | 101213311102102122213 |
5 | 124320112230201434 |
6 | 2324154242405303 |
7 | 153330506563560 |
oct | 21476522223247 |
9 | 4252722057263 |
10 | 1211001022119 |
11 | 427645562909 |
12 | 176849960833 |
13 | 8a2737ac655 |
14 | 428815c3167 |
15 | 2177a8cc9e9 |
hex | 119f54926a7 |
1211001022119 has 32 divisors (see below), whose sum is σ = 2026912481280. Its totient is φ = 627076039392.
The previous prime is 1211001022109. The next prime is 1211001022123. The reversal of 1211001022119 is 9112201001121.
It is not a de Polignac number, because 1211001022119 - 28 = 1211001021863 is a prime.
It is a super-2 number, since 2×12110010221192 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1211001022095 and 1211001022104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211001022109) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65971047 + ... + 65989400.
It is an arithmetic number, because the mean of its divisors is an integer number (63341015040).
Almost surely, 21211001022119 is an apocalyptic number.
1211001022119 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
1211001022119 is a deficient number, since it is larger than the sum of its proper divisors (815911459161).
1211001022119 is a wasteful number, since it uses less digits than its factorization.
1211001022119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131960499.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 1211001022119 in words is "one trillion, two hundred eleven billion, one million, twenty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •