Base | Representation |
---|---|
bin | 1101101111011000000100… |
… | …11010110111100011110001 |
3 | 10221222112112202010210011102 |
4 | 12313230002122313203301 |
5 | 12430021044143300410 |
6 | 144132350332054145 |
7 | 6235654140234446 |
oct | 667540232674361 |
9 | 127875482123142 |
10 | 30215135525105 |
11 | 969a19232a293 |
12 | 347ba8b904355 |
13 | 13b23763a8a2b |
14 | 7665c568d9cd |
15 | 375e71dd32a5 |
hex | 1b7b026b78f1 |
30215135525105 has 8 divisors (see below), whose sum is σ = 38166486979200. Its totient is φ = 22899892187376.
The previous prime is 30215135525101. The next prime is 30215135525137. The reversal of 30215135525105 is 50152553151203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30215135525105 - 22 = 30215135525101 is a prime.
It is a super-2 number, since 2×302151355251052 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (30215135525101) 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, 159027028985 + ... + 159027029174.
It is an arithmetic number, because the mean of its divisors is an integer number (4770810872400).
Almost surely, 230215135525105 is an apocalyptic number.
It is an amenable number.
30215135525105 is a deficient number, since it is larger than the sum of its proper divisors (7951351454095).
30215135525105 is a wasteful number, since it uses less digits than its factorization.
30215135525105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318054058183.
The product of its (nonzero) digits is 112500, while the sum is 38.
Adding to 30215135525105 its reverse (50152553151203), we get a palindrome (80367688676308).
The spelling of 30215135525105 in words is "thirty trillion, two hundred fifteen billion, one hundred thirty-five million, five hundred twenty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •