Base | Representation |
---|---|
bin | 1000110010110000101… |
… | …10110111101111011011 |
3 | 1001212211222002101021120 |
4 | 10121120112313233123 |
5 | 14422230301214321 |
6 | 350444024340323 |
7 | 30554031326061 |
oct | 4313026675733 |
9 | 1055758071246 |
10 | 302130101211 |
11 | 107150624924 |
12 | 4a67a9146a3 |
13 | 2264c228823 |
14 | 108a1dc6031 |
15 | 7cd46beec6 |
hex | 46585b7bdb |
302130101211 has 8 divisors (see below), whose sum is σ = 420354923520. Its totient is φ = 192662673192.
The previous prime is 302130101209. The next prime is 302130101213. The reversal of 302130101211 is 112101031203.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (302130101209) and next prime (302130101213).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 302130101211 - 21 = 302130101209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (302130101213) 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 in 7 ways as a sum of consecutive naturals, for example, 2189348491 + ... + 2189348628.
It is an arithmetic number, because the mean of its divisors is an integer number (52544365440).
Almost surely, 2302130101211 is an apocalyptic number.
302130101211 is a deficient number, since it is larger than the sum of its proper divisors (118224822309).
302130101211 is a wasteful number, since it uses less digits than its factorization.
302130101211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4378697145.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 302130101211 its reverse (112101031203), we get a palindrome (414231132414).
The spelling of 302130101211 in words is "three hundred two billion, one hundred thirty million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •