Base | Representation |
---|---|
bin | 111100010100101… |
… | …001010101001011 |
3 | 2121112100012221000 |
4 | 330110221111023 |
5 | 4033040421011 |
6 | 244231350043 |
7 | 34036145616 |
oct | 7424512513 |
9 | 2545305830 |
10 | 1012045131 |
11 | 47a300539 |
12 | 242b22323 |
13 | 131896896 |
14 | 985a517d |
15 | 5dcb0356 |
hex | 3c52954b |
1012045131 has 8 divisors (see below), whose sum is σ = 1499326160. Its totient is φ = 674696736.
The previous prime is 1012045121. The next prime is 1012045159. The reversal of 1012045131 is 1315402101.
1012045131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1012045131 - 213 = 1012036939 is a prime.
It is a super-2 number, since 2×10120451312 = 2048470694361614322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012045121) 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, 18741550 + ... + 18741603.
It is an arithmetic number, because the mean of its divisors is an integer number (187415770).
Almost surely, 21012045131 is an apocalyptic number.
1012045131 is a deficient number, since it is larger than the sum of its proper divisors (487281029).
1012045131 is an equidigital number, since it uses as much as digits as its factorization.
1012045131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37483162 (or 37483156 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 1012045131 is about 31812.6567736805. The cubic root of 1012045131 is about 1003.9990301071. Note that the first 3 decimals are identical.
Adding to 1012045131 its reverse (1315402101), we get a palindrome (2327447232).
The spelling of 1012045131 in words is "one billion, twelve million, forty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •