Base | Representation |
---|---|
bin | 1101000011101010… |
… | …1010101011100101 |
3 | 100001021100111010001 |
4 | 3100322222223211 |
5 | 24134242240401 |
6 | 1335445101301 |
7 | 152600230543 |
oct | 32072525345 |
9 | 10037314101 |
10 | 3505040101 |
11 | 153955a562 |
12 | 8199b7831 |
13 | 43b212734 |
14 | 253710d93 |
15 | 157aa5601 |
hex | d0eaaae5 |
3505040101 has 2 divisors, whose sum is σ = 3505040102. Its totient is φ = 3505040100.
The previous prime is 3505040069. The next prime is 3505040111. The reversal of 3505040101 is 1010405053.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1936088001 + 1568952100 = 44001^2 + 39610^2 .
It is a cyclic number.
It is not a de Polignac number, because 3505040101 - 25 = 3505040069 is a prime.
It is a super-2 number, since 2×35050401012 = 24570612219236180402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3505040111) 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, 1752520050 + 1752520051.
It is an arithmetic number, because the mean of its divisors is an integer number (1752520051).
Almost surely, 23505040101 is an apocalyptic number.
It is an amenable number.
3505040101 is a deficient number, since it is larger than the sum of its proper divisors (1).
3505040101 is an equidigital number, since it uses as much as digits as its factorization.
3505040101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 300, while the sum is 19.
The square root of 3505040101 is about 59203.3791349784. The cubic root of 3505040101 is about 1519.0229323462.
Adding to 3505040101 its reverse (1010405053), we get a palindrome (4515445154).
The spelling of 3505040101 in words is "three billion, five hundred five million, forty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •