Base | Representation |
---|---|
bin | 111101000000011101… |
… | …1001100011111101001 |
3 | 110112011110020012100111 |
4 | 1322000323030133221 |
5 | 4121303034121301 |
6 | 140104110134321 |
7 | 12315412540366 |
oct | 1720073143751 |
9 | 415143205314 |
10 | 131012020201 |
11 | 5061a962967 |
12 | 214837b13a1 |
13 | c47b75cc5a |
14 | 64aba6546d |
15 | 361bb1b551 |
hex | 1e80ecc7e9 |
131012020201 has 4 divisors (see below), whose sum is σ = 135529676100. Its totient is φ = 126494364304.
The previous prime is 131012020199. The next prime is 131012020213. The reversal of 131012020201 is 102020210131.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 39690202176 + 91321818025 = 199224^2 + 302195^2 .
It is a cyclic number.
It is not a de Polignac number, because 131012020201 - 21 = 131012020199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131012020001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2258827906 + ... + 2258827963.
It is an arithmetic number, because the mean of its divisors is an integer number (33882419025).
Almost surely, 2131012020201 is an apocalyptic number.
It is an amenable number.
131012020201 is a deficient number, since it is larger than the sum of its proper divisors (4517655899).
131012020201 is an equidigital number, since it uses as much as digits as its factorization.
131012020201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4517655898.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 131012020201 its reverse (102020210131), we get a palindrome (233032230332).
It can be divided in two parts, 13101 and 2020201, that added together give a palindrome (2033302).
The spelling of 131012020201 in words is "one hundred thirty-one billion, twelve million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •