Base | Representation |
---|---|
bin | 101011111111100110000… |
… | …000111101010101101101 |
3 | 101201000110110201022111101 |
4 | 223333212000331111231 |
5 | 344013024040120023 |
6 | 10232503142323101 |
7 | 431264143445635 |
oct | 53774600752555 |
9 | 11630413638441 |
10 | 3023221020013 |
11 | a661604a5807 |
12 | 409b06729491 |
13 | 18c11c625b2c |
14 | a6478cb96c5 |
15 | 539931611ad |
hex | 2bfe603d56d |
3023221020013 has 4 divisors (see below), whose sum is σ = 3201057550620. Its totient is φ = 2845384489408.
The previous prime is 3023221020011. The next prime is 3023221020031. The reversal of 3023221020013 is 3100201223203.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1072877496804 + 1950343523209 = 1035798^2 + 1396547^2 .
It is a cyclic number.
It is not a de Polignac number, because 3023221020013 - 21 = 3023221020011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3023221020011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88918265278 + ... + 88918265311.
It is an arithmetic number, because the mean of its divisors is an integer number (800264387655).
Almost surely, 23023221020013 is an apocalyptic number.
It is an amenable number.
3023221020013 is a deficient number, since it is larger than the sum of its proper divisors (177836530607).
3023221020013 is a wasteful number, since it uses less digits than its factorization.
3023221020013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177836530606.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 3023221020013 its reverse (3100201223203), we get a palindrome (6123422243216).
The spelling of 3023221020013 in words is "three trillion, twenty-three billion, two hundred twenty-one million, twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •