Base | Representation |
---|---|
bin | 100000001111010111100… |
… | …1110100100101001111011 |
3 | 120200121022120102011012010 |
4 | 1000132233032210221323 |
5 | 1040044243041141011 |
6 | 13231332523221003 |
7 | 635063402014434 |
oct | 100365716445173 |
9 | 16617276364163 |
10 | 4431051115131 |
11 | 145921a923393 |
12 | 5b6926077763 |
13 | 261b004c4b84 |
14 | 11466d3a248b |
15 | 7a3dd9091a6 |
hex | 407af3a4a7b |
4431051115131 has 8 divisors (see below), whose sum is σ = 6111794641680. Its totient is φ = 2852170832672.
The previous prime is 4431051115111. The next prime is 4431051115133. The reversal of 4431051115131 is 1315111501344.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4431051115131 - 27 = 4431051115003 is a prime.
It is a super-2 number, since 2×44310511151312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4431051115133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25465810920 + ... + 25465811093.
It is an arithmetic number, because the mean of its divisors is an integer number (763974330210).
Almost surely, 24431051115131 is an apocalyptic number.
4431051115131 is a deficient number, since it is larger than the sum of its proper divisors (1680743526549).
4431051115131 is a wasteful number, since it uses less digits than its factorization.
4431051115131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50931622045.
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 4431051115131 its reverse (1315111501344), we get a palindrome (5746162616475).
The spelling of 4431051115131 in words is "four trillion, four hundred thirty-one billion, fifty-one million, one hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •