Base | Representation |
---|---|
bin | 11101011011100100000… |
… | …111011000101010000000 |
3 | 21011100022211122000022010 |
4 | 131123210013120222000 |
5 | 231114000203122433 |
6 | 4145034530412520 |
7 | 266055326255034 |
oct | 35334407305200 |
9 | 7140284560263 |
10 | 2022461770368 |
11 | 70a7a2a42376 |
12 | 287b72431140 |
13 | 118942c74660 |
14 | 6dc5dab41c4 |
15 | 3791ee21e63 |
hex | 1d6e41d8a80 |
2022461770368 has 256 divisors, whose sum is σ = 5850778752000. Its totient is φ = 615277264896.
The previous prime is 2022461770331. The next prime is 2022461770393. The reversal of 2022461770368 is 8630771642202.
It is a super-2 number, since 2×20224617703682 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 943751505 + ... + 943753647.
It is an arithmetic number, because the mean of its divisors is an integer number (22854604500).
Almost surely, 22022461770368 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2022461770368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2925389376000).
2022461770368 is an abundant number, since it is smaller than the sum of its proper divisors (3828316981632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2022461770368 is a wasteful number, since it uses less digits than its factorization.
2022461770368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4219 (or 4207 counting only the distinct ones).
The product of its (nonzero) digits is 1354752, while the sum is 48.
The spelling of 2022461770368 in words is "two trillion, twenty-two billion, four hundred sixty-one million, seven hundred seventy thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •