Base | Representation |
---|---|
bin | 1001010100000011001… |
… | …00100011001011000110 |
3 | 1010120222110010112122100 |
4 | 10222001210203023012 |
5 | 20220330331001042 |
6 | 403001233012530 |
7 | 32055635131152 |
oct | 4520144431306 |
9 | 1116873115570 |
10 | 320001422022 |
11 | 113791507747 |
12 | 520279b4146 |
13 | 242398b3879 |
14 | 116b96b8062 |
15 | 84cd60b24c |
hex | 4a819232c6 |
320001422022 has 48 divisors (see below), whose sum is σ = 703231206912. Its totient is φ = 105145419120.
The previous prime is 320001422017. The next prime is 320001422051. The reversal of 320001422022 is 220224100023.
320001422022 is a `hidden beast` number, since 320 + 0 + 0 + 142 + 202 + 2 = 666.
It is a super-2 number, since 2×3200014220222 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 320001421986 and 320001422004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8014873 + ... + 8054699.
It is an arithmetic number, because the mean of its divisors is an integer number (14650650144).
Almost surely, 2320001422022 is an apocalyptic number.
320001422022 is an abundant number, since it is smaller than the sum of its proper divisors (383229784890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
320001422022 is a wasteful number, since it uses less digits than its factorization.
320001422022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46193 (or 46190 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
Adding to 320001422022 its reverse (220224100023), we get a palindrome (540225522045).
The spelling of 320001422022 in words is "three hundred twenty billion, one million, four hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •