Base | Representation |
---|---|
bin | 1101110100101010… |
… | …10100111010000011 |
3 | 201011012010222000011 |
4 | 12322111110322003 |
5 | 110144301321011 |
6 | 3224220205351 |
7 | 351621323515 |
oct | 67225247203 |
9 | 21135128004 |
10 | 7421120131 |
11 | 3169035437 |
12 | 1531399857 |
13 | 913630759 |
14 | 50585bbb5 |
15 | 2d67a0621 |
hex | 1ba554e83 |
7421120131 has 8 divisors (see below), whose sum is σ = 7908539904. Its totient is φ = 6947430600.
The previous prime is 7421120107. The next prime is 7421120173. The reversal of 7421120131 is 1310211247.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 7421120131 - 25 = 7421120099 is a prime.
It is a super-2 number, since 2×74211201312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (7421120191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3431445 + ... + 3433606.
It is an arithmetic number, because the mean of its divisors is an integer number (988567488).
Almost surely, 27421120131 is an apocalyptic number.
7421120131 is a deficient number, since it is larger than the sum of its proper divisors (487419773).
7421120131 is a wasteful number, since it uses less digits than its factorization.
7421120131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6865121.
The product of its (nonzero) digits is 336, while the sum is 22.
The square root of 7421120131 is about 86145.9234729073. The cubic root of 7421120131 is about 1950.5473047129.
Adding to 7421120131 its reverse (1310211247), we get a palindrome (8731331378).
The spelling of 7421120131 in words is "seven billion, four hundred twenty-one million, one hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •