Base | Representation |
---|---|
bin | 110010001001011100110… |
… | …100111101001011101101 |
3 | 110012110001002221012021011 |
4 | 302021130310331023231 |
5 | 422430124004013412 |
6 | 11155043132105221 |
7 | 503655044345524 |
oct | 62113464751355 |
9 | 13173032835234 |
10 | 3446121157357 |
11 | 110954560a24a |
12 | 477a6b005211 |
13 | 1bcc7742a1a8 |
14 | bcb165b34bb |
15 | 5e9951e07a7 |
hex | 3225cd3d2ed |
3446121157357 has 2 divisors, whose sum is σ = 3446121157358. Its totient is φ = 3446121157356.
The previous prime is 3446121157337. The next prime is 3446121157361. The reversal of 3446121157357 is 7537511216443.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3361260223876 + 84860933481 = 1833374^2 + 291309^2 .
It is a cyclic number.
It is not a de Polignac number, because 3446121157357 - 27 = 3446121157229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3446121157357.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3446121157337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1723060578678 + 1723060578679.
It is an arithmetic number, because the mean of its divisors is an integer number (1723060578679).
Almost surely, 23446121157357 is an apocalyptic number.
It is an amenable number.
3446121157357 is a deficient number, since it is larger than the sum of its proper divisors (1).
3446121157357 is an equidigital number, since it uses as much as digits as its factorization.
3446121157357 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2116800, while the sum is 49.
The spelling of 3446121157357 in words is "three trillion, four hundred forty-six billion, one hundred twenty-one million, one hundred fifty-seven thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •