Base | Representation |
---|---|
bin | 100010010101100011110001… |
… | …0110011010000110101010001 |
3 | 1110121101210201222000012101201 |
4 | 1010223013202303100311101 |
5 | 304041430322234423441 |
6 | 2550210431502431201 |
7 | 120421650631415332 |
oct | 10453074263206521 |
9 | 1417353658005351 |
10 | 302030200311121 |
11 | 8826631a18a017 |
12 | 29a5b586b92501 |
13 | cc6b430697069 |
14 | 54824a8194289 |
15 | 24db772d31c31 |
hex | 112b1e2cd0d51 |
302030200311121 has 4 divisors (see below), whose sum is σ = 302044758108912. Its totient is φ = 302015642513332.
The previous prime is 302030200311109. The next prime is 302030200311163. The reversal of 302030200311121 is 121113002030203.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 302030200311121 - 211 = 302030200309073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (302030200911121) 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, 7278867775 + ... + 7278909268.
It is an arithmetic number, because the mean of its divisors is an integer number (75511189527228).
Almost surely, 2302030200311121 is an apocalyptic number.
It is an amenable number.
302030200311121 is a deficient number, since it is larger than the sum of its proper divisors (14557797791).
302030200311121 is a wasteful number, since it uses less digits than its factorization.
302030200311121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14557797790.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 302030200311121 its reverse (121113002030203), we get a palindrome (423143202341324).
The spelling of 302030200311121 in words is "three hundred two trillion, thirty billion, two hundred million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •