Base | Representation |
---|---|
bin | 111010100001110001111… |
… | …100101011100000010110 |
3 | 112020111111011200110112200 |
4 | 322201301330223200112 |
5 | 1011344024241340202 |
6 | 12315403134225330 |
7 | 563402636311653 |
oct | 72416174534026 |
9 | 15214434613480 |
10 | 4022001121302 |
11 | 13107a286374a |
12 | 54b5a8055246 |
13 | 232371c50bc8 |
14 | dc9472d2c2a |
15 | 6e94c75ae1c |
hex | 3a871f2b816 |
4022001121302 has 48 divisors (see below), whose sum is σ = 9015922188000. Its totient is φ = 1294280330112.
The previous prime is 4022001121261. The next prime is 4022001121337. The reversal of 4022001121302 is 2031211002204.
It is a happy number.
4022001121302 is a `hidden beast` number, since 40 + 2 + 200 + 1 + 121 + 302 = 666.
4022001121302 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
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, 3885199 + ... + 4810277.
It is an arithmetic number, because the mean of its divisors is an integer number (187831712250).
Almost surely, 24022001121302 is an apocalyptic number.
4022001121302 is an abundant number, since it is smaller than the sum of its proper divisors (4993921066698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4022001121302 is a wasteful number, since it uses less digits than its factorization.
4022001121302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 933445 (or 933442 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 4022001121302 its reverse (2031211002204), we get a palindrome (6053212123506).
The spelling of 4022001121302 in words is "four trillion, twenty-two billion, one million, one hundred twenty-one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •