Base | Representation |
---|---|
bin | 11101011011100010000… |
… | …000101000101100110110 |
3 | 21011100020101011101021010 |
4 | 131123202000220230312 |
5 | 231113412132243041 |
6 | 4145031225333050 |
7 | 266054420104314 |
oct | 35334200505466 |
9 | 7140211141233 |
10 | 2022426446646 |
11 | 70a785006111 |
12 | 287b62637186 |
13 | 118938857448 |
14 | 6dc5911b0b4 |
15 | 3791bc95a16 |
hex | 1d6e2028b36 |
2022426446646 has 8 divisors (see below), whose sum is σ = 4044852893304. Its totient is φ = 674142148880.
The previous prime is 2022426446617. The next prime is 2022426446647. The reversal of 2022426446646 is 6466446242202.
It is a sphenic number, since it is the product of 3 distinct primes.
2022426446646 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 2022426446595 and 2022426446604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2022426446647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 168535537215 + ... + 168535537226.
It is an arithmetic number, because the mean of its divisors is an integer number (505606611663).
Almost surely, 22022426446646 is an apocalyptic number.
2022426446646 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2022426446646 is a wasteful number, since it uses less digits than its factorization.
2022426446646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337071074446.
The product of its (nonzero) digits is 5308416, while the sum is 48.
The spelling of 2022426446646 in words is "two trillion, twenty-two billion, four hundred twenty-six million, four hundred forty-six thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •