Base | Representation |
---|---|
bin | 1011010010101011… |
… | …0100000101111101 |
3 | 21211020120222002221 |
4 | 2310222310011331 |
5 | 22201431403201 |
6 | 1220435245341 |
7 | 135054054154 |
oct | 26452640575 |
9 | 7736528087 |
10 | 3031122301 |
11 | 1315a98059 |
12 | 707149851 |
13 | 393c902bc |
14 | 20a7c859b |
15 | 12b1904a1 |
hex | b4ab417d |
3031122301 has 2 divisors, whose sum is σ = 3031122302. Its totient is φ = 3031122300.
The previous prime is 3031122293. The next prime is 3031122319. The reversal of 3031122301 is 1032211303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2778344100 + 252778201 = 52710^2 + 15899^2 .
It is an emirp because it is prime and its reverse (1032211303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3031122301 - 23 = 3031122293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3031162301) 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 as a sum of consecutive naturals, namely, 1515561150 + 1515561151.
It is an arithmetic number, because the mean of its divisors is an integer number (1515561151).
Almost surely, 23031122301 is an apocalyptic number.
It is an amenable number.
3031122301 is a deficient number, since it is larger than the sum of its proper divisors (1).
3031122301 is an equidigital number, since it uses as much as digits as its factorization.
3031122301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 3031122301 is about 55055.6291490707. The cubic root of 3031122301 is about 1447.2197698587.
Adding to 3031122301 its reverse (1032211303), we get a palindrome (4063333604).
The spelling of 3031122301 in words is "three billion, thirty-one million, one hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •