Base | Representation |
---|---|
bin | 101011111111101011011… |
… | …000101011001100000001 |
3 | 101201000200202021000211111 |
4 | 223333223120223030001 |
5 | 344013220121420301 |
6 | 10232520121443321 |
7 | 431266316351305 |
oct | 53775330531401 |
9 | 11630622230744 |
10 | 3023311123201 |
11 | a661a7347656 |
12 | 409b30940541 |
13 | 18c1351b2a25 |
14 | a6486c51d05 |
15 | 5399b00d551 |
hex | 2bfeb62b301 |
3023311123201 has 2 divisors, whose sum is σ = 3023311123202. Its totient is φ = 3023311123200.
The previous prime is 3023311123199. The next prime is 3023311123219. The reversal of 3023311123201 is 1023211133203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3011002330176 + 12308793025 = 1735224^2 + 110945^2 .
It is a cyclic number.
It is not a de Polignac number, because 3023311123201 - 21 = 3023311123199 is a prime.
Together with 3023311123199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3023311123801) 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, 1511655561600 + 1511655561601.
It is an arithmetic number, because the mean of its divisors is an integer number (1511655561601).
Almost surely, 23023311123201 is an apocalyptic number.
It is an amenable number.
3023311123201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3023311123201 is an equidigital number, since it uses as much as digits as its factorization.
3023311123201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3023311123201 its reverse (1023211133203), we get a palindrome (4046522256404).
The spelling of 3023311123201 in words is "three trillion, twenty-three billion, three hundred eleven million, one hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •