Base | Representation |
---|---|
bin | 1111000100110010110100… |
… | …0000100010111100100001 |
3 | 2011200120001121112020110102 |
4 | 3301030231000202330201 |
5 | 4133031132140204441 |
6 | 55130244312312145 |
7 | 3330335535436265 |
oct | 361145500427441 |
9 | 64616047466412 |
10 | 16575033913121 |
11 | 5310483596412 |
12 | 1a384293a2655 |
13 | 933032954438 |
14 | 4143435260a5 |
15 | 1db24c02469b |
hex | f132d022f21 |
16575033913121 has 2 divisors, whose sum is σ = 16575033913122. Its totient is φ = 16575033913120.
The previous prime is 16575033913093. The next prime is 16575033913127. The reversal of 16575033913121 is 12131933057561.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9458085160000 + 7116948753121 = 3075400^2 + 2667761^2 .
It is a cyclic number.
It is not a de Polignac number, because 16575033913121 - 230 = 16573960171297 is a prime.
It is a super-2 number, since 2×165750339131212 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16575033913127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8287516956560 + 8287516956561.
It is an arithmetic number, because the mean of its divisors is an integer number (8287516956561).
Almost surely, 216575033913121 is an apocalyptic number.
It is an amenable number.
16575033913121 is a deficient number, since it is larger than the sum of its proper divisors (1).
16575033913121 is an equidigital number, since it uses as much as digits as its factorization.
16575033913121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 510300, while the sum is 47.
The spelling of 16575033913121 in words is "sixteen trillion, five hundred seventy-five billion, thirty-three million, nine hundred thirteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •