Base | Representation |
---|---|
bin | 1100101010100010… |
… | …0110011010110001 |
3 | 22202221000122101111 |
4 | 3022220212122301 |
5 | 23430302001003 |
6 | 1321202033321 |
7 | 150150320035 |
oct | 31250463261 |
9 | 8687018344 |
10 | 3399640753 |
11 | 1495010463 |
12 | 7aa648841 |
13 | 42242b462 |
14 | 2437161c5 |
15 | 14d6d5e6d |
hex | caa266b1 |
3399640753 has 2 divisors, whose sum is σ = 3399640754. Its totient is φ = 3399640752.
The previous prime is 3399640729. The next prime is 3399640793. The reversal of 3399640753 is 3570469933.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3385261489 + 14379264 = 58183^2 + 3792^2 .
It is an emirp because it is prime and its reverse (3570469933) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3399640753 - 229 = 2862769841 is a prime.
It is a super-3 number, since 3×33996407533 (a number of 30 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3399640697 and 3399640706.
It is not a weakly prime, because it can be changed into another prime (3399640793) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1699820376 + 1699820377.
It is an arithmetic number, because the mean of its divisors is an integer number (1699820377).
Almost surely, 23399640753 is an apocalyptic number.
It is an amenable number.
3399640753 is a deficient number, since it is larger than the sum of its proper divisors (1).
3399640753 is an equidigital number, since it uses as much as digits as its factorization.
3399640753 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1837080, while the sum is 49.
The square root of 3399640753 is about 58306.4383494653. The cubic root of 3399640753 is about 1503.6416337736.
The spelling of 3399640753 in words is "three billion, three hundred ninety-nine million, six hundred forty thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •