Base | Representation |
---|---|
bin | 11101011011001111110… |
… | …011100010011000100001 |
3 | 21011022110002110020210120 |
4 | 131123033303202120201 |
5 | 231112300440214014 |
6 | 4144541035150453 |
7 | 266044021045353 |
oct | 35331763423041 |
9 | 7138402406716 |
10 | 2022121023009 |
11 | 70a63866788a |
12 | 287a982a5429 |
13 | 1188ba4aaab9 |
14 | 6dc2a7350d3 |
15 | 37900064ba9 |
hex | 1d6cfce2621 |
2022121023009 has 4 divisors (see below), whose sum is σ = 2696161364016. Its totient is φ = 1348080682004.
The previous prime is 2022121022963. The next prime is 2022121023047. The reversal of 2022121023009 is 9003201212202.
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 not a de Polignac number, because 2022121023009 - 213 = 2022121014817 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2022121023009.
It is not an unprimeable number, because it can be changed into a prime (2022121043009) 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, 337020170499 + ... + 337020170504.
It is an arithmetic number, because the mean of its divisors is an integer number (674040341004).
Almost surely, 22022121023009 is an apocalyptic number.
It is an amenable number.
2022121023009 is a deficient number, since it is larger than the sum of its proper divisors (674040341007).
2022121023009 is an equidigital number, since it uses as much as digits as its factorization.
2022121023009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 674040341006.
The product of its (nonzero) digits is 864, while the sum is 24.
It can be divided in two parts, 202212 and 1023009, that added together give a palindrome (1225221).
The spelling of 2022121023009 in words is "two trillion, twenty-two billion, one hundred twenty-one million, twenty-three thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •