Base | Representation |
---|---|
bin | 110001011001010111111… |
… | …111001001000001010001 |
3 | 110000111210120020122111121 |
4 | 301121113333021001101 |
5 | 421103414041134044 |
6 | 11115224550442241 |
7 | 500146611523315 |
oct | 61312777110121 |
9 | 13014716218447 |
10 | 3394500333649 |
11 | 1099665a42377 |
12 | 469a63363381 |
13 | 1b813b9433a9 |
14 | ba41a8cbb45 |
15 | 5d4733d6984 |
hex | 31657fc9051 |
3394500333649 has 2 divisors, whose sum is σ = 3394500333650. Its totient is φ = 3394500333648.
The previous prime is 3394500333641. The next prime is 3394500333659. The reversal of 3394500333649 is 9463330054933.
3394500333649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1714612162624 + 1679888171025 = 1309432^2 + 1296105^2 .
It is a cyclic number.
It is not a de Polignac number, because 3394500333649 - 23 = 3394500333641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3394500333596 and 3394500333605.
It is not a weakly prime, because it can be changed into another prime (3394500333641) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1697250166824 + 1697250166825.
It is an arithmetic number, because the mean of its divisors is an integer number (1697250166825).
Almost surely, 23394500333649 is an apocalyptic number.
It is an amenable number.
3394500333649 is a deficient number, since it is larger than the sum of its proper divisors (1).
3394500333649 is an equidigital number, since it uses as much as digits as its factorization.
3394500333649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9447840, while the sum is 52.
The spelling of 3394500333649 in words is "three trillion, three hundred ninety-four billion, five hundred million, three hundred thirty-three thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •