Base | Representation |
---|---|
bin | 1011010010011101… |
… | …0110001000001101 |
3 | 21211011212202222001 |
4 | 2310213112020031 |
5 | 22201213310013 |
6 | 1220403552301 |
7 | 135043246423 |
oct | 26447261015 |
9 | 7734782861 |
10 | 3030213133 |
11 | 1315526a82 |
12 | 70698b691 |
13 | 393a3252c |
14 | 20a62d113 |
15 | 12b060ddd |
hex | b49d620d |
3030213133 has 2 divisors, whose sum is σ = 3030213134. Its totient is φ = 3030213132.
The previous prime is 3030213113. The next prime is 3030213169. The reversal of 3030213133 is 3313120303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2943388009 + 86825124 = 54253^2 + 9318^2 .
It is an emirp because it is prime and its reverse (3313120303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3030213133 - 213 = 3030204941 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3030213133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3030213113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515106566 + 1515106567.
It is an arithmetic number, because the mean of its divisors is an integer number (1515106567).
Almost surely, 23030213133 is an apocalyptic number.
It is an amenable number.
3030213133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3030213133 is an equidigital number, since it uses as much as digits as its factorization.
3030213133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 19.
The square root of 3030213133 is about 55047.3717174580. The cubic root of 3030213133 is about 1447.0750602597.
Adding to 3030213133 its reverse (3313120303), we get a palindrome (6343333436).
The spelling of 3030213133 in words is "three billion, thirty million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •