Base | Representation |
---|---|
bin | 1011101010111111… |
… | …1100101000100101 |
3 | 22002100112120011001 |
4 | 2322233330220211 |
5 | 22404040200201 |
6 | 1234521513301 |
7 | 140433114406 |
oct | 27257745045 |
9 | 8070476131 |
10 | 3133131301 |
11 | 1368630a13 |
12 | 735342831 |
13 | 3ac158361 |
14 | 21a17d9ad |
15 | 1350e0301 |
hex | babfca25 |
3133131301 has 2 divisors, whose sum is σ = 3133131302. Its totient is φ = 3133131300.
The previous prime is 3133131299. The next prime is 3133131341. The reversal of 3133131301 is 1031313313.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3060966276 + 72165025 = 55326^2 + 8495^2 .
It is a cyclic number.
It is not a de Polignac number, because 3133131301 - 21 = 3133131299 is a prime.
Together with 3133131299, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3133131341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1566565650 + 1566565651.
It is an arithmetic number, because the mean of its divisors is an integer number (1566565651).
Almost surely, 23133131301 is an apocalyptic number.
It is an amenable number.
3133131301 is a deficient number, since it is larger than the sum of its proper divisors (1).
3133131301 is an equidigital number, since it uses as much as digits as its factorization.
3133131301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 19.
The square root of 3133131301 is about 55974.3807558422. The cubic root of 3133131301 is about 1463.2758278377.
Adding to 3133131301 its reverse (1031313313), we get a palindrome (4164444614).
The spelling of 3133131301 in words is "three billion, one hundred thirty-three million, one hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •