Base | Representation |
---|---|
bin | 100010010110001001111101… |
… | …0011011111001111110110101 |
3 | 1110121200122101202011222101201 |
4 | 1010230103322123321332311 |
5 | 304044301242003020041 |
6 | 2550312232414452501 |
7 | 120430612660555513 |
oct | 10454237233717665 |
9 | 1417618352158351 |
10 | 302112201220021 |
11 | 882980795a3615 |
12 | 29a73450b04131 |
13 | cc7609b203b2a |
14 | 54864469834b3 |
15 | 24dd971ce2631 |
hex | 112c4fa6f9fb5 |
302112201220021 has 16 divisors (see below), whose sum is σ = 303015426024960. Its totient is φ = 301209722953920.
The previous prime is 302112201219991. The next prime is 302112201220087. The reversal of 302112201220021 is 120022102211203.
It is a cyclic number.
It is not a de Polignac number, because 302112201220021 - 233 = 302103611285429 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 (302112201220321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10585186011 + ... + 10585214551.
It is an arithmetic number, because the mean of its divisors is an integer number (18938464126560).
Almost surely, 2302112201220021 is an apocalyptic number.
It is an amenable number.
302112201220021 is a deficient number, since it is larger than the sum of its proper divisors (903224804939).
302112201220021 is a wasteful number, since it uses less digits than its factorization.
302112201220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40524.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 302112201220021 its reverse (120022102211203), we get a palindrome (422134303431224).
The spelling of 302112201220021 in words is "three hundred two trillion, one hundred twelve billion, two hundred one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •