Base | Representation |
---|---|
bin | 100010010101100011110100… |
… | …1010110001100100110000101 |
3 | 1110121101211000121122200110102 |
4 | 1010223013221112030212011 |
5 | 304041431033343211401 |
6 | 2550210450424333445 |
7 | 120421653434033165 |
oct | 10453075126144605 |
9 | 1417354017580412 |
10 | 302030310132101 |
11 | 88266376179161 |
12 | 29a5b5b7914285 |
13 | cc6b44a368aa5 |
14 | 54824b89c05a5 |
15 | 24db77c7c656b |
hex | 112b1e958c985 |
302030310132101 has 16 divisors (see below), whose sum is σ = 307143683303424. Its totient is φ = 296970089923584.
The previous prime is 302030310132073. The next prime is 302030310132169. The reversal of 302030310132101 is 101231013030203.
It is a cyclic number.
It is not a de Polignac number, because 302030310132101 - 226 = 302030243023237 is a prime.
It is a super-2 number, since 2×3020303101321012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302030310132301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13358456 + ... + 27973361.
It is an arithmetic number, because the mean of its divisors is an integer number (19196480206464).
Almost surely, 2302030310132101 is an apocalyptic number.
It is an amenable number.
302030310132101 is a deficient number, since it is larger than the sum of its proper divisors (5113373171323).
302030310132101 is a wasteful number, since it uses less digits than its factorization.
302030310132101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41332460.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 302030310132101 its reverse (101231013030203), we get a palindrome (403261323162304).
The spelling of 302030310132101 in words is "three hundred two trillion, thirty billion, three hundred ten million, one hundred thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •