Base | Representation |
---|---|
bin | 111010101011001000011… |
… | …000111011010011100100 |
3 | 112021110101220001110011011 |
4 | 322223020120323103210 |
5 | 1012030110033114340 |
6 | 12324143314152004 |
7 | 564206512401352 |
oct | 72531030732344 |
9 | 15243356043134 |
10 | 4032041301220 |
11 | 1314a852214a9 |
12 | 55152a582604 |
13 | 2332b2068a7a |
14 | dd21a9147d2 |
15 | 6ed38e040ea |
hex | 3aac863b4e4 |
4032041301220 has 48 divisors (see below), whose sum is σ = 8481380685120. Its totient is φ = 1610132860544.
The previous prime is 4032041301193. The next prime is 4032041301221. The reversal of 4032041301220 is 221031402304.
4032041301220 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 4032041301191 and 4032041301200.
It is not an unprimeable number, because it can be changed into a prime (4032041301221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81039111 + ... + 81088849.
It is an arithmetic number, because the mean of its divisors is an integer number (176695430940).
Almost surely, 24032041301220 is an apocalyptic number.
It is an amenable number.
4032041301220 is an abundant number, since it is smaller than the sum of its proper divisors (4449339383900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4032041301220 is a wasteful number, since it uses less digits than its factorization.
4032041301220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56412 (or 56410 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 4032041301220 its reverse (221031402304), we get a palindrome (4253072703524).
The spelling of 4032041301220 in words is "four trillion, thirty-two billion, forty-one million, three hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •