Base | Representation |
---|---|
bin | 1011010010110000… |
… | …0101000110110011 |
3 | 21211021012211021221 |
4 | 2310230011012303 |
5 | 22202023013011 |
6 | 1220450325511 |
7 | 135056635456 |
oct | 26454050663 |
9 | 7737184257 |
10 | 3031454131 |
11 | 13161a43a2 |
12 | 707289897 |
13 | 394078354 |
14 | 20a87349d |
15 | 12b208971 |
hex | b4b051b3 |
3031454131 has 8 divisors (see below), whose sum is σ = 3046086144. Its totient is φ = 3016857480.
The previous prime is 3031454099. The next prime is 3031454159. The reversal of 3031454131 is 1314541303.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3031454131 - 25 = 3031454099 is a prime.
It is a super-2 number, since 2×30314541312 = 18379428296713930322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3031454096 and 3031454105.
It is not an unprimeable number, because it can be changed into a prime (3031454431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 171786 + ... + 188608.
It is an arithmetic number, because the mean of its divisors is an integer number (380760768).
Almost surely, 23031454131 is an apocalyptic number.
3031454131 is a deficient number, since it is larger than the sum of its proper divisors (14632013).
3031454131 is a wasteful number, since it uses less digits than its factorization.
3031454131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17681.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 3031454131 is about 55058.6426549002. The cubic root of 3031454131 is about 1447.2725790567.
Adding to 3031454131 its reverse (1314541303), we get a palindrome (4345995434).
The spelling of 3031454131 in words is "three billion, thirty-one million, four hundred fifty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •