Base | Representation |
---|---|
bin | 110000110000001000110… |
… | …000100001111001111001 |
3 | 102212021111200200022012202 |
4 | 300300020300201321321 |
5 | 414342223141233033 |
6 | 11043023120115545 |
7 | 464021416204025 |
oct | 60601060417171 |
9 | 12767450608182 |
10 | 3350221430393 |
11 | 1081903725a52 |
12 | 461366465bb5 |
13 | 1b3c0324a016 |
14 | b8219d29385 |
15 | 5c230e368e8 |
hex | 30c08c21e79 |
3350221430393 has 2 divisors, whose sum is σ = 3350221430394. Its totient is φ = 3350221430392.
The previous prime is 3350221430389. The next prime is 3350221430441. The reversal of 3350221430393 is 3930341220533.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2650878935104 + 699342495289 = 1628152^2 + 836267^2 .
It is a cyclic number.
It is not a de Polignac number, because 3350221430393 - 22 = 3350221430389 is a prime.
It is a super-2 number, since 2×33502214303932 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3350221430993) 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, 1675110715196 + 1675110715197.
It is an arithmetic number, because the mean of its divisors is an integer number (1675110715197).
Almost surely, 23350221430393 is an apocalyptic number.
It is an amenable number.
3350221430393 is a deficient number, since it is larger than the sum of its proper divisors (1).
3350221430393 is an equidigital number, since it uses as much as digits as its factorization.
3350221430393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 38.
The spelling of 3350221430393 in words is "three trillion, three hundred fifty billion, two hundred twenty-one million, four hundred thirty thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •