Base | Representation |
---|---|
bin | 101101100111000000000… |
… | …011001010011000101101 |
3 | 102002122001111101010202211 |
4 | 231213000003022120231 |
5 | 402322422310310404 |
6 | 10355504523450421 |
7 | 442304500512025 |
oct | 55470003123055 |
9 | 12078044333684 |
10 | 3134253213229 |
11 | aa9258257966 |
12 | 427533086a11 |
13 | 199735922248 |
14 | ab9ad1caa85 |
15 | 567e0b98b04 |
hex | 2d9c00ca62d |
3134253213229 has 2 divisors, whose sum is σ = 3134253213230. Its totient is φ = 3134253213228.
The previous prime is 3134253213209. The next prime is 3134253213239. The reversal of 3134253213229 is 9223123524313.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2610906588900 + 523346624329 = 1615830^2 + 723427^2 .
It is a cyclic number.
It is not a de Polignac number, because 3134253213229 - 225 = 3134219658797 is a prime.
It is a super-2 number, since 2×31342532132292 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3134253213191 and 3134253213200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3134253213209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1567126606614 + 1567126606615.
It is an arithmetic number, because the mean of its divisors is an integer number (1567126606615).
Almost surely, 23134253213229 is an apocalyptic number.
It is an amenable number.
3134253213229 is a deficient number, since it is larger than the sum of its proper divisors (1).
3134253213229 is an equidigital number, since it uses as much as digits as its factorization.
3134253213229 is an evil number, because the sum of its binary digits is even.
The product of its digits is 233280, while the sum is 40.
The spelling of 3134253213229 in words is "three trillion, one hundred thirty-four billion, two hundred fifty-three million, two hundred thirteen thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •