Base | Representation |
---|---|
bin | 1101101100010100010011… |
… | …10010010110110100010111 |
3 | 10221121111020221010001112001 |
4 | 12312022021302112310113 |
5 | 12421310321300033330 |
6 | 144012205151540131 |
7 | 6225243446513002 |
oct | 666121162266427 |
9 | 127544227101461 |
10 | 30110032424215 |
11 | 9659658377a37 |
12 | 3463638b2a647 |
13 | 13a549657c683 |
14 | 7614949b0539 |
15 | 37336eb789ca |
hex | 1b6289c96d17 |
30110032424215 has 8 divisors (see below), whose sum is σ = 38257452962640. Its totient is φ = 22671083236992.
The previous prime is 30110032424149. The next prime is 30110032424239. The reversal of 30110032424215 is 51242423001103.
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 30110032424215 - 239 = 29560276610327 is a prime.
It is a super-2 number, since 2×301100324242152 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 177117837705 + ... + 177117837874.
It is an arithmetic number, because the mean of its divisors is an integer number (4782181620330).
Almost surely, 230110032424215 is an apocalyptic number.
30110032424215 is a deficient number, since it is larger than the sum of its proper divisors (8147420538425).
30110032424215 is a wasteful number, since it uses less digits than its factorization.
30110032424215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 354235675601.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 30110032424215 its reverse (51242423001103), we get a palindrome (81352455425318).
The spelling of 30110032424215 in words is "thirty trillion, one hundred ten billion, thirty-two million, four hundred twenty-four thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •