Base | Representation |
---|---|
bin | 111100000110100100100… |
… | …010101100110101001100 |
3 | 112121211211102101000001002 |
4 | 330012210202230311030 |
5 | 1020132144334201104 |
6 | 12441222045035432 |
7 | 604253542601600 |
oct | 74064442546514 |
9 | 15554742330032 |
10 | 4130224131404 |
11 | 1352688935a68 |
12 | 56856b855b78 |
13 | 23c62b2562a7 |
14 | 103c924ad500 |
15 | 7268384301e |
hex | 3c1a48acd4c |
4130224131404 has 36 divisors (see below), whose sum is σ = 8472139192440. Its totient is φ = 1756583861760.
The previous prime is 4130224131403. The next prime is 4130224131431. The reversal of 4130224131404 is 4041314220314.
It is a super-2 number, since 2×41302241314042 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4130224131403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 80403989 + ... + 80455340.
It is an arithmetic number, because the mean of its divisors is an integer number (235337199790).
Almost surely, 24130224131404 is an apocalyptic number.
It is an amenable number.
4130224131404 is an abundant number, since it is smaller than the sum of its proper divisors (4341915061036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4130224131404 is a wasteful number, since it uses less digits than its factorization.
4130224131404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160859478 (or 160859469 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 4130224131404 its reverse (4041314220314), we get a palindrome (8171538351718).
The spelling of 4130224131404 in words is "four trillion, one hundred thirty billion, two hundred twenty-four million, one hundred thirty-one thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •