Base | Representation |
---|---|
bin | 1011100011001001… |
… | …0101000010100001 |
3 | 22000001120112102202 |
4 | 2320302111002201 |
5 | 22322122413441 |
6 | 1231344022545 |
7 | 136553163143 |
oct | 27062250241 |
9 | 8001515382 |
10 | 3100201121 |
11 | 1350a89a96 |
12 | 726301a55 |
13 | 3a5398744 |
14 | 215a4ac93 |
15 | 13228819b |
hex | b8c950a1 |
3100201121 has 2 divisors, whose sum is σ = 3100201122. Its totient is φ = 3100201120.
The previous prime is 3100201099. The next prime is 3100201127. The reversal of 3100201121 is 1211020013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1653235600 + 1446965521 = 40660^2 + 38039^2 .
It is a cyclic number.
It is not a de Polignac number, because 3100201121 - 210 = 3100200097 is a prime.
It is a super-2 number, since 2×31002011212 = 19222493981299313282, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3100201127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1550100560 + 1550100561.
It is an arithmetic number, because the mean of its divisors is an integer number (1550100561).
Almost surely, 23100201121 is an apocalyptic number.
It is an amenable number.
3100201121 is a deficient number, since it is larger than the sum of its proper divisors (1).
3100201121 is an equidigital number, since it uses as much as digits as its factorization.
3100201121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 3100201121 is about 55679.4497189044. The cubic root of 3100201121 is about 1458.1312678843.
Adding to 3100201121 its reverse (1211020013), we get a palindrome (4311221134).
The spelling of 3100201121 in words is "three billion, one hundred million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •