Base | Representation |
---|---|
bin | 1101110000000110100110… |
… | …01000101011000110100001 |
3 | 10222001221000101211200220110 |
4 | 12320003103020223012201 |
5 | 12430423222134430423 |
6 | 144152040553201533 |
7 | 6240530111102346 |
oct | 670032310530641 |
9 | 128057011750813 |
10 | 30240112030113 |
11 | 96a9839979167 |
12 | 34848a04002a9 |
13 | 13b4826aa708b |
14 | 7678b487c7cd |
15 | 3769349b4193 |
hex | 1b80d322b1a1 |
30240112030113 has 32 divisors (see below), whose sum is σ = 41743623312000. Its totient is φ = 19449446284800.
The previous prime is 30240112030111. The next prime is 30240112030151. The reversal of 30240112030113 is 31103021104203.
It is not a de Polignac number, because 30240112030113 - 21 = 30240112030111 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 30240112030113.
It is not an unprimeable number, because it can be changed into a prime (30240112030111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 972929733 + ... + 972960813.
It is an arithmetic number, because the mean of its divisors is an integer number (1304488228500).
Almost surely, 230240112030113 is an apocalyptic number.
It is an amenable number.
30240112030113 is a deficient number, since it is larger than the sum of its proper divisors (11503511281887).
30240112030113 is a wasteful number, since it uses less digits than its factorization.
30240112030113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39633.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 30240112030113 its reverse (31103021104203), we get a palindrome (61343133134316).
The spelling of 30240112030113 in words is "thirty trillion, two hundred forty billion, one hundred twelve million, thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •