Base | Representation |
---|---|
bin | 1010000000010010011010… |
… | …11001011011000001000001 |
3 | 2212220012011020222210102100 |
4 | 11000021031121123001001 |
5 | 10340422221434000001 |
6 | 114442414400341013 |
7 | 4430312336014434 |
oct | 500111531330101 |
9 | 85805136883370 |
10 | 22000121000001 |
11 | 7012220842a21 |
12 | 2573930014769 |
13 | c377aa932231 |
14 | 560b50c0781b |
15 | 2824187b5586 |
hex | 14024d65b041 |
22000121000001 has 24 divisors (see below), whose sum is σ = 33192906626880. Its totient is φ = 14023511996256.
The previous prime is 22000120999837. The next prime is 22000121000003. The reversal of 22000121000001 is 10000012100022.
It is not a de Polignac number, because 22000121000001 - 227 = 21999986782273 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (22000121000003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 409155891 + ... + 409209656.
It is an arithmetic number, because the mean of its divisors is an integer number (1383037776120).
Almost surely, 222000121000001 is an apocalyptic number.
It is an amenable number.
22000121000001 is a deficient number, since it is larger than the sum of its proper divisors (11192785626879).
22000121000001 is a wasteful number, since it uses less digits than its factorization.
22000121000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 818365685 (or 818365682 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 22000121000001 its reverse (10000012100022), we get a palindrome (32000133100023).
It can be divided in two parts, 22000 and 121000001, that added together give a square (121022001 = 110012).
The spelling of 22000121000001 in words is "twenty-two trillion, one hundred twenty-one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •