Base | Representation |
---|---|
bin | 101101101000000100101… |
… | …101010001111110000111 |
3 | 102002202000202212022021011 |
4 | 231220010231101332013 |
5 | 402332302201330111 |
6 | 10400215112503051 |
7 | 442345155442123 |
oct | 55500455217607 |
9 | 12082022768234 |
10 | 3135405105031 |
11 | aa9799495261 |
12 | 4277b49aaa87 |
13 | 19988a471424 |
14 | aba7c196583 |
15 | 5685bd80021 |
hex | 2da04b51f87 |
3135405105031 has 2 divisors, whose sum is σ = 3135405105032. Its totient is φ = 3135405105030.
The previous prime is 3135405104969. The next prime is 3135405105073. The reversal of 3135405105031 is 1305015045313.
3135405105031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3135405105031 - 215 = 3135405072263 is a prime.
It is a super-3 number, since 3×31354051050313 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 3135405104984 and 3135405105002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3135405105331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1567702552515 + 1567702552516.
It is an arithmetic number, because the mean of its divisors is an integer number (1567702552516).
Almost surely, 23135405105031 is an apocalyptic number.
3135405105031 is a deficient number, since it is larger than the sum of its proper divisors (1).
3135405105031 is an equidigital number, since it uses as much as digits as its factorization.
3135405105031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 31.
The spelling of 3135405105031 in words is "three trillion, one hundred thirty-five billion, four hundred five million, one hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •