Base | Representation |
---|---|
bin | 1101111011001011001000… |
… | …01101100000010101011110 |
3 | 11000102021212111202222101202 |
4 | 12331211210031200111132 |
5 | 13003141242244140402 |
6 | 145042510454235502 |
7 | 6310154420011055 |
oct | 675454415402536 |
9 | 130367774688352 |
10 | 30620503115102 |
11 | 983609a80847a |
12 | 3526560655b92 |
13 | 1411668a7a314 |
14 | 77c07c67d39c |
15 | 381799b43b02 |
hex | 1bd96436055e |
30620503115102 has 8 divisors (see below), whose sum is σ = 46577666710512. Its totient is φ = 15094614211600.
The previous prime is 30620503115099. The next prime is 30620503115119. The reversal of 30620503115102 is 20151130502603.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×306205031151022 (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 3 ways as a sum of consecutive naturals, for example, 107818672799 + ... + 107818673082.
It is an arithmetic number, because the mean of its divisors is an integer number (5822208338814).
Almost surely, 230620503115102 is an apocalyptic number.
30620503115102 is a deficient number, since it is larger than the sum of its proper divisors (15957163595410).
30620503115102 is a wasteful number, since it uses less digits than its factorization.
30620503115102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215637345954.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 30620503115102 its reverse (20151130502603), we get a palindrome (50771633617705).
The spelling of 30620503115102 in words is "thirty trillion, six hundred twenty billion, five hundred three million, one hundred fifteen thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •