Base | Representation |
---|---|
bin | 111101001001010110… |
… | …1001000000101011010 |
3 | 110112221020112111111122 |
4 | 1322102231020011122 |
5 | 4122410420301020 |
6 | 140153443525242 |
7 | 12325664215100 |
oct | 1722255100532 |
9 | 415836474448 |
10 | 131310322010 |
11 | 5076328748a |
12 | 21547689822 |
13 | c4c84b4aba |
14 | 64d9515c70 |
15 | 3637de2125 |
hex | 1e92b4815a |
131310322010 has 48 divisors (see below), whose sum is σ = 275604366240. Its totient is φ = 44913163680.
The previous prime is 131310321991. The next prime is 131310322019. The reversal of 131310322010 is 10223013131.
It is a self number, because there is not a number n which added to its sum of digits gives 131310322010.
It is not an unprimeable number, because it can be changed into a prime (131310322019) 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 23 ways as a sum of consecutive naturals, for example, 114476 + ... + 525095.
It is an arithmetic number, because the mean of its divisors is an integer number (5741757630).
Almost surely, 2131310322010 is an apocalyptic number.
131310322010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131310322010 is an abundant number, since it is smaller than the sum of its proper divisors (144294044230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131310322010 is a wasteful number, since it uses less digits than its factorization.
131310322010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 640011 (or 640004 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 131310322010 its reverse (10223013131), we get a palindrome (141533335141).
The spelling of 131310322010 in words is "one hundred thirty-one billion, three hundred ten million, three hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •