Base | Representation |
---|---|
bin | 1000011100001011… |
… | …11010110111000011 |
3 | 102200210121222101111 |
4 | 10032011322313003 |
5 | 33240014301011 |
6 | 2025351344151 |
7 | 220202160046 |
oct | 41605726703 |
9 | 12623558344 |
10 | 4531400131 |
11 | 1a15947a95 |
12 | a65682057 |
13 | 572a4bb6b |
14 | 30db60c5d |
15 | 1b7c42121 |
hex | 10e17adc3 |
4531400131 has 4 divisors (see below), whose sum is σ = 4728417552. Its totient is φ = 4334382712.
The previous prime is 4531400123. The next prime is 4531400141. The reversal of 4531400131 is 1310041354.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4531400131 - 23 = 4531400123 is a prime.
It is a super-2 number, since 2×45314001312 = 41067174294453634322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4531400141) 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 3 ways as a sum of consecutive naturals, for example, 98508676 + ... + 98508721.
It is an arithmetic number, because the mean of its divisors is an integer number (1182104388).
Almost surely, 24531400131 is an apocalyptic number.
4531400131 is a deficient number, since it is larger than the sum of its proper divisors (197017421).
4531400131 is a wasteful number, since it uses less digits than its factorization.
4531400131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197017420.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 4531400131 is about 67315.6752250172. The cubic root of 4531400131 is about 1654.7947623541.
Adding to 4531400131 its reverse (1310041354), we get a palindrome (5841441485).
The spelling of 4531400131 in words is "four billion, five hundred thirty-one million, four hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •