Base | Representation |
---|---|
bin | 100010010110001000111011… |
… | …1111101000100110110111110 |
3 | 1110121200102202011222011022112 |
4 | 1010230101313331010312332 |
5 | 304044232301044200110 |
6 | 2550311231254214022 |
7 | 120430504506422501 |
oct | 10454216775046676 |
9 | 1417612664864275 |
10 | 302110012100030 |
11 | 88297155925342 |
12 | 29a72b3b954312 |
13 | cc75b0c811764 |
14 | 54862b9d39138 |
15 | 24dd894a24405 |
hex | 112c477f44dbe |
302110012100030 has 8 divisors (see below), whose sum is σ = 543798021780072. Its totient is φ = 120844004840008.
The previous prime is 302110012099981. The next prime is 302110012100033. The reversal of 302110012100030 is 30001210011203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×3021100121000302 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 302110012099978 and 302110012100014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302110012100033) 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, 15105500604992 + ... + 15105500605011.
It is an arithmetic number, because the mean of its divisors is an integer number (67974752722509).
Almost surely, 2302110012100030 is an apocalyptic number.
302110012100030 is a deficient number, since it is larger than the sum of its proper divisors (241688009680042).
302110012100030 is a wasteful number, since it uses less digits than its factorization.
302110012100030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30211001210010.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 302110012100030 its reverse (30001210011203), we get a palindrome (332111222111233).
The spelling of 302110012100030 in words is "three hundred two trillion, one hundred ten billion, twelve million, one hundred thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •