Base | Representation |
---|---|
bin | 110000010100111100010… |
… | …010001110101000111111 |
3 | 102202111010200011102021202 |
4 | 300110330102032220333 |
5 | 413402422402200302 |
6 | 11021353412250115 |
7 | 461635666564544 |
oct | 60247422165077 |
9 | 12674120142252 |
10 | 3321021131327 |
11 | 1070489939089 |
12 | 45777731093b |
13 | 1b122b761953 |
14 | b6a49bacbcb |
15 | 5b5c2626202 |
hex | 3053c48ea3f |
3321021131327 has 2 divisors, whose sum is σ = 3321021131328. Its totient is φ = 3321021131326.
The previous prime is 3321021131293. The next prime is 3321021131333. The reversal of 3321021131327 is 7231311201233.
3321021131327 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3321021131327 - 218 = 3321020869183 is a prime.
It is a super-2 number, since 2×33210211313272 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3321021131327.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3321021131357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1660510565663 + 1660510565664.
It is an arithmetic number, because the mean of its divisors is an integer number (1660510565664).
Almost surely, 23321021131327 is an apocalyptic number.
3321021131327 is a deficient number, since it is larger than the sum of its proper divisors (1).
3321021131327 is an equidigital number, since it uses as much as digits as its factorization.
3321021131327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 29.
The spelling of 3321021131327 in words is "three trillion, three hundred twenty-one billion, twenty-one million, one hundred thirty-one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •