Base | Representation |
---|---|
bin | 111100001110100… |
… | …001111110010011 |
3 | 2121102022210000122 |
4 | 330032201332103 |
5 | 4032133122011 |
6 | 244133140455 |
7 | 34016421266 |
oct | 7416417623 |
9 | 2542283018 |
10 | 1010442131 |
11 | 479406146 |
12 | 24248a72b |
13 | 13145506a |
14 | 982a8cdd |
15 | 5da953db |
hex | 3c3a1f93 |
1010442131 has 4 divisors (see below), whose sum is σ = 1011096000. Its totient is φ = 1009788264.
The previous prime is 1010442127. The next prime is 1010442137. The reversal of 1010442131 is 1312440101.
It is a happy number.
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 1010442131 - 22 = 1010442127 is a prime.
It is a super-2 number, since 2×10104421312 = 2041986600199642322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010442137) 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, 324611 + ... + 327708.
It is an arithmetic number, because the mean of its divisors is an integer number (252774000).
Almost surely, 21010442131 is an apocalyptic number.
1010442131 is a deficient number, since it is larger than the sum of its proper divisors (653869).
1010442131 is an equidigital number, since it uses as much as digits as its factorization.
1010442131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 653868.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 1010442131 is about 31787.4524144355. The cubic root of 1010442131 is about 1003.4686647867.
Adding to 1010442131 its reverse (1312440101), we get a palindrome (2322882232).
The spelling of 1010442131 in words is "one billion, ten million, four hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •