Base | Representation |
---|---|
bin | 101100100101001111010… |
… | …100000001010000001001 |
3 | 101211212210111112121210221 |
4 | 230211033110001100021 |
5 | 400143314414030441 |
6 | 10303230131310041 |
7 | 434224625065042 |
oct | 54451724012011 |
9 | 11755714477727 |
10 | 3063642330121 |
11 | a8131325431a |
12 | 41590774b321 |
13 | 192b91a6b4c9 |
14 | a83d13d78c9 |
15 | 54a5bb1a8d1 |
hex | 2c94f501409 |
3063642330121 has 4 divisors (see below), whose sum is σ = 3243856584852. Its totient is φ = 2883428075392.
The previous prime is 3063642330113. The next prime is 3063642330149. The reversal of 3063642330121 is 1210332463603.
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 1115482394896 + 1948159935225 = 1056164^2 + 1395765^2 .
It is a cyclic number.
It is not a de Polignac number, because 3063642330121 - 23 = 3063642330113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3063642330521) 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, 90107127340 + ... + 90107127373.
It is an arithmetic number, because the mean of its divisors is an integer number (810964146213).
Almost surely, 23063642330121 is an apocalyptic number.
It is an amenable number.
3063642330121 is a deficient number, since it is larger than the sum of its proper divisors (180214254731).
3063642330121 is a wasteful number, since it uses less digits than its factorization.
3063642330121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 180214254730.
The product of its (nonzero) digits is 46656, while the sum is 34.
Adding to 3063642330121 its reverse (1210332463603), we get a palindrome (4273974793724).
The spelling of 3063642330121 in words is "three trillion, sixty-three billion, six hundred forty-two million, three hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •