Base | Representation |
---|---|
bin | 111010101001010110100… |
… | …010100010111000111000 |
3 | 112021021110202220021100011 |
4 | 322221112202202320320 |
5 | 1012012202043020044 |
6 | 12323230002351304 |
7 | 564111260103460 |
oct | 72512642427070 |
9 | 15237422807304 |
10 | 4030131220024 |
11 | 13141950101a8 |
12 | 55109695b534 |
13 | 233069415700 |
14 | dd0b8d84ba0 |
15 | 6ec763a4134 |
hex | 3aa568a2e38 |
4030131220024 has 96 divisors (see below), whose sum is σ = 9653062256640. Its totient is φ = 1542907267200.
The previous prime is 4030131220021. The next prime is 4030131220057. The reversal of 4030131220024 is 4200221310304.
It is a super-2 number, since 2×40301312200242 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4030131219977 and 4030131220004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4030131220021) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6574972 + ... + 7161739.
It is an arithmetic number, because the mean of its divisors is an integer number (100552731840).
Almost surely, 24030131220024 is an apocalyptic number.
It is an amenable number.
4030131220024 is an abundant number, since it is smaller than the sum of its proper divisors (5622931036616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4030131220024 is a wasteful number, since it uses less digits than its factorization.
4030131220024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13736781 (or 13736764 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 4030131220024 its reverse (4200221310304), we get a palindrome (8230352530328).
The spelling of 4030131220024 in words is "four trillion, thirty billion, one hundred thirty-one million, two hundred twenty thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •