Base | Representation |
---|---|
bin | 111101000001000101… |
… | …1010110100110001101 |
3 | 110112012220202202122001 |
4 | 1322002023112212031 |
5 | 4121323424024401 |
6 | 140110140352301 |
7 | 12316056255445 |
oct | 1720213264615 |
9 | 415186682561 |
10 | 131033033101 |
11 | 506308051a3 |
12 | 2148a845691 |
13 | c482c09419 |
14 | 64b0775125 |
15 | 361d8bc601 |
hex | 1e822d698d |
131033033101 has 2 divisors, whose sum is σ = 131033033102. Its totient is φ = 131033033100.
The previous prime is 131033033093. The next prime is 131033033107. The reversal of 131033033101 is 101330330131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 120512428201 + 10520604900 = 347149^2 + 102570^2 .
It is an emirp because it is prime and its reverse (101330330131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 131033033101 - 23 = 131033033093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131033033107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65516516550 + 65516516551.
It is an arithmetic number, because the mean of its divisors is an integer number (65516516551).
Almost surely, 2131033033101 is an apocalyptic number.
It is an amenable number.
131033033101 is a deficient number, since it is larger than the sum of its proper divisors (1).
131033033101 is an equidigital number, since it uses as much as digits as its factorization.
131033033101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 131033033101 its reverse (101330330131), we get a palindrome (232363363232).
It can be divided in two parts, 1310330 and 33101, that added together give a palindrome (1343431).
The spelling of 131033033101 in words is "one hundred thirty-one billion, thirty-three million, thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •