Base | Representation |
---|---|
bin | 11100111000111100… |
… | …101111111100101001 |
3 | 2222001212000110101111 |
4 | 130320330233330221 |
5 | 1002012134021301 |
6 | 22130034550321 |
7 | 2145465343525 |
oct | 347074577451 |
9 | 88055013344 |
10 | 31020220201 |
11 | 12179118623 |
12 | 60187383a1 |
13 | 2c048619a9 |
14 | 1703b3ad85 |
15 | c184a1551 |
hex | 738f2ff29 |
31020220201 has 2 divisors, whose sum is σ = 31020220202. Its totient is φ = 31020220200.
The previous prime is 31020220183. The next prime is 31020220207. The reversal of 31020220201 is 10202202013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28694666025 + 2325554176 = 169395^2 + 48224^2 .
It is an emirp because it is prime and its reverse (10202202013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31020220201 - 27 = 31020220073 is a prime.
It is a super-2 number, since 2×310202202012 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31020220207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15510110100 + 15510110101.
It is an arithmetic number, because the mean of its divisors is an integer number (15510110101).
Almost surely, 231020220201 is an apocalyptic number.
It is an amenable number.
31020220201 is a deficient number, since it is larger than the sum of its proper divisors (1).
31020220201 is an equidigital number, since it uses as much as digits as its factorization.
31020220201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 31020220201 its reverse (10202202013), we get a palindrome (41222422214).
It can be divided in two parts, 3 and 1020220201, that multiplied together give a palindrome (3060660603).
The spelling of 31020220201 in words is "thirty-one billion, twenty million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •