Base | Representation |
---|---|
bin | 111101000000011110… |
… | …0010011110010001001 |
3 | 110112011110210000220022 |
4 | 1322000330103302021 |
5 | 4121303122442301 |
6 | 140104120310225 |
7 | 12315415164611 |
oct | 1720074236211 |
9 | 415143700808 |
10 | 131012312201 |
11 | 50620042291 |
12 | 21483912375 |
13 | c47b832b34 |
14 | 64abadda41 |
15 | 361bb77d1b |
hex | 1e80f13c89 |
131012312201 has 8 divisors (see below), whose sum is σ = 136866931200. Its totient is φ = 125170895872.
The previous prime is 131012312191. The next prime is 131012312213. The reversal of 131012312201 is 102213210131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-131012312201 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 131012312201.
It is not an unprimeable number, because it can be changed into a prime (131012312401) 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, 3280376 + ... + 3320073.
It is an arithmetic number, because the mean of its divisors is an integer number (17108366400).
Almost surely, 2131012312201 is an apocalyptic number.
It is an amenable number.
131012312201 is a deficient number, since it is larger than the sum of its proper divisors (5854618999).
131012312201 is an equidigital number, since it uses as much as digits as its factorization.
131012312201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6601335.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 131012312201 its reverse (102213210131), we get a palindrome (233225522332).
The spelling of 131012312201 in words is "one hundred thirty-one billion, twelve million, three hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •