Base | Representation |
---|---|
bin | 1111100111100… |
… | …00110111100101 |
3 | 100010111222222000 |
4 | 13303300313211 |
5 | 232014310041 |
6 | 20555555513 |
7 | 3150365262 |
oct | 763606745 |
9 | 303458860 |
10 | 131010021 |
11 | 67a5184a |
12 | 37a5bb99 |
13 | 211b042c |
14 | 13584269 |
15 | b77cbb6 |
hex | 7cf0de5 |
131010021 has 8 divisors (see below), whose sum is σ = 194088960. Its totient is φ = 87339996.
The previous prime is 131010013. The next prime is 131010037. The reversal of 131010021 is 120010131.
It is not a de Polignac number, because 131010021 - 23 = 131010013 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 131009985 and 131010012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131010071) 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, 2426085 + ... + 2426138.
It is an arithmetic number, because the mean of its divisors is an integer number (24261120).
Almost surely, 2131010021 is an apocalyptic number.
It is an amenable number.
131010021 is a deficient number, since it is larger than the sum of its proper divisors (63078939).
131010021 is an equidigital number, since it uses as much as digits as its factorization.
131010021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4852232 (or 4852226 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 131010021 is about 11445.9609033056. The cubic root of 131010021 is about 507.8882576573. Note that the first 3 decimals are identical.
Adding to 131010021 its reverse (120010131), we get a palindrome (251020152).
The spelling of 131010021 in words is "one hundred thirty-one million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •