Base | Representation |
---|---|
bin | 100010010101100011110001… |
… | …1011101001110110111001101 |
3 | 1110121101210202201201011021110 |
4 | 1010223013203131032313031 |
5 | 304041430333044004401 |
6 | 2550210432534322233 |
7 | 120421651124060145 |
oct | 10453074335166715 |
9 | 1417353681634243 |
10 | 302030211313101 |
11 | 88266325413a67 |
12 | 29a5b58a7b9379 |
13 | cc6b432a499cb |
14 | 54824a9819925 |
15 | 24db773ca69d6 |
hex | 112b1e374edcd |
302030211313101 has 8 divisors (see below), whose sum is σ = 403029371920000. Its totient is φ = 201192262457472.
The previous prime is 302030211313097. The next prime is 302030211313183. The reversal of 302030211313101 is 101313112030203.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 302030211313101 - 22 = 302030211313097 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 (302030211313001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40302933445 + ... + 40302940938.
It is an arithmetic number, because the mean of its divisors is an integer number (50378671490000).
Almost surely, 2302030211313101 is an apocalyptic number.
It is an amenable number.
302030211313101 is a deficient number, since it is larger than the sum of its proper divisors (100999160606899).
302030211313101 is a wasteful number, since it uses less digits than its factorization.
302030211313101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80605875635.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 302030211313101 its reverse (101313112030203), we get a palindrome (403343323343304).
The spelling of 302030211313101 in words is "three hundred two trillion, thirty billion, two hundred eleven million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •