Base | Representation |
---|---|
bin | 101110100110001100101… |
… | …000010011101001100001 |
3 | 102100010012112220200021011 |
4 | 232212030220103221201 |
5 | 404430410130341001 |
6 | 10451010134300521 |
7 | 450226162004425 |
oct | 56461450235141 |
9 | 12303175820234 |
10 | 3202110012001 |
11 | 102500969414a |
12 | 4387101b7741 |
13 | 1a2c5b034094 |
14 | b0da930cb85 |
15 | 5846305bd51 |
hex | 2e98ca13a61 |
3202110012001 has 2 divisors, whose sum is σ = 3202110012002. Its totient is φ = 3202110012000.
The previous prime is 3202110011963. The next prime is 3202110012011. The reversal of 3202110012001 is 1002100112023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2201261832225 + 1000848179776 = 1483665^2 + 1000424^2 .
It is an emirp because it is prime and its reverse (1002100112023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3202110012001 - 27 = 3202110011873 is a prime.
It is not a weakly prime, because it can be changed into another prime (3202110012011) 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, 1601055006000 + 1601055006001.
It is an arithmetic number, because the mean of its divisors is an integer number (1601055006001).
Almost surely, 23202110012001 is an apocalyptic number.
It is an amenable number.
3202110012001 is a deficient number, since it is larger than the sum of its proper divisors (1).
3202110012001 is an equidigital number, since it uses as much as digits as its factorization.
3202110012001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 3202110012001 its reverse (1002100112023), we get a palindrome (4204210124024).
The spelling of 3202110012001 in words is "three trillion, two hundred two billion, one hundred ten million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •