Base | Representation |
---|---|
bin | 111010100001110011101… |
… | …110110001111011000000 |
3 | 112020111120020222002022022 |
4 | 322201303232301323000 |
5 | 1011344104421011000 |
6 | 12315410123301012 |
7 | 563403451456112 |
oct | 72416356617300 |
9 | 15214506862268 |
10 | 4022031032000 |
11 | 1310808733033 |
12 | 54b5b607a768 |
13 | 2323781c4347 |
14 | dc94b27b3b2 |
15 | 6e9501b8585 |
hex | 3a873bb1ec0 |
4022031032000 has 112 divisors (see below), whose sum is σ = 9963444497760. Its totient is φ = 1608346496000.
The previous prime is 4022031031961. The next prime is 4022031032021. The reversal of 4022031032000 is 2301302204.
It is a self number, because there is not a number n which added to its sum of digits gives 4022031032000.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 28240970 + ... + 28383030.
Almost surely, 24022031032000 is an apocalyptic number.
4022031032000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4022031032000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4981722248880).
4022031032000 is an abundant number, since it is smaller than the sum of its proper divisors (5941413465760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4022031032000 is a wasteful number, since it uses less digits than its factorization.
4022031032000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145627 (or 145607 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 4022031032000 its reverse (2301302204), we get a palindrome (4024332334204).
The spelling of 4022031032000 in words is "four trillion, twenty-two billion, thirty-one million, thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •