Base | Representation |
---|---|
bin | 1101110010101110001111… |
… | …00111010000001110100001 |
3 | 10222101112022201121100220020 |
4 | 12321113013213100032201 |
5 | 12433412032414024441 |
6 | 144301243411104053 |
7 | 6250164322024206 |
oct | 671270747201641 |
9 | 128345281540806 |
10 | 30330113033121 |
11 | 9733a24114890 |
12 | 349a2195a2029 |
13 | 13c016ab8aa45 |
14 | 76bdb195bcad |
15 | 378e50e8ce66 |
hex | 1b95c79d03a1 |
30330113033121 has 16 divisors (see below), whose sum is σ = 44612219378880. Its totient is φ = 18175348632320.
The previous prime is 30330113033057. The next prime is 30330113033137. The reversal of 30330113033121 is 12133031103303.
It is not a de Polignac number, because 30330113033121 - 26 = 30330113033057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30330113033091 and 30330113033100.
It is not an unprimeable number, because it can be changed into a prime (30330113033321) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 5163448380 + ... + 5163454253.
It is an arithmetic number, because the mean of its divisors is an integer number (2788263711180).
Almost surely, 230330113033121 is an apocalyptic number.
It is an amenable number.
30330113033121 is a deficient number, since it is larger than the sum of its proper divisors (14282106345759).
30330113033121 is a wasteful number, since it uses less digits than its factorization.
30330113033121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10326902736.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 30330113033121 its reverse (12133031103303), we get a palindrome (42463144136424).
The spelling of 30330113033121 in words is "thirty trillion, three hundred thirty billion, one hundred thirteen million, thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •