Base | Representation |
---|---|
bin | 10001110010000100111… |
… | …000110111000001010001 |
3 | 11022211012021222120112002 |
4 | 101302010320313001101 |
5 | 130010124023210001 |
6 | 2333213521243345 |
7 | 154200206254664 |
oct | 21620470670121 |
9 | 4284167876462 |
10 | 1222000210001 |
11 | 43127a29652a |
12 | 1789b9493555 |
13 | 8b3074b144c |
14 | 432063216db |
15 | 21bc135b46b |
hex | 11c84e37051 |
1222000210001 has 4 divisors (see below), whose sum is σ = 1222117012992. Its totient is φ = 1221883407012.
The previous prime is 1222000209979. The next prime is 1222000210087. The reversal of 1222000210001 is 1000120002221.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1222000210001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1222000215001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58385801 + ... + 58406726.
It is an arithmetic number, because the mean of its divisors is an integer number (305529253248).
Almost surely, 21222000210001 is an apocalyptic number.
It is an amenable number.
1222000210001 is a deficient number, since it is larger than the sum of its proper divisors (116802991).
1222000210001 is a wasteful number, since it uses less digits than its factorization.
1222000210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116802990.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 1222000210001 its reverse (1000120002221), we get a palindrome (2222120212222).
The spelling of 1222000210001 in words is "one trillion, two hundred twenty-two billion, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •