Base | Representation |
---|---|
bin | 11101000111000011110… |
… | …00001011001100111011 |
3 | 10112121202012011210222211 |
4 | 32203201320023030323 |
5 | 112341423313342334 |
6 | 2043255020555551 |
7 | 132156301552663 |
oct | 16434170131473 |
9 | 3477665153884 |
10 | 1000222012219 |
11 | 356212282a71 |
12 | 141a243b2bb7 |
13 | 7342228c111 |
14 | 365a7b191a3 |
15 | 1b040ebca64 |
hex | e8e1e0b33b |
1000222012219 has 8 divisors (see below), whose sum is σ = 1052883041040. Its totient is φ = 947562759936.
The previous prime is 1000222012213. The next prime is 1000222012249. The reversal of 1000222012219 is 9122102220001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1000222012219 - 215 = 1000221979451 is a prime.
It is a super-2 number, since 2×10002220122192 (a number of 25 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 1000222012219.
It is not an unprimeable number, because it can be changed into a prime (1000222012213) 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, 801087 + ... + 1625479.
It is an arithmetic number, because the mean of its divisors is an integer number (131610380130).
Almost surely, 21000222012219 is an apocalyptic number.
1000222012219 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
1000222012219 is a deficient number, since it is larger than the sum of its proper divisors (52661028821).
1000222012219 is an equidigital number, since it uses as much as digits as its factorization.
1000222012219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888269.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 1000222012219 in words is "one trillion, two hundred twenty-two million, twelve thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •