Base | Representation |
---|---|
bin | 1101111000101000101111… |
… | …01110010011100110010101 |
3 | 11000002221211121100101010222 |
4 | 12330110113232103212111 |
5 | 13000224220023202013 |
6 | 144534451440524125 |
7 | 6300650101132142 |
oct | 674242756234625 |
9 | 130087747311128 |
10 | 30533320522133 |
11 | 9802121483a50 |
12 | 351168b320645 |
13 | 140638386b3c0 |
14 | 777b6ba173c9 |
15 | 37e395cde508 |
hex | 1bc517b93995 |
30533320522133 has 32 divisors (see below), whose sum is σ = 36000709621632. Its totient is φ = 25529954515200.
The previous prime is 30533320522129. The next prime is 30533320522181. The reversal of 30533320522133 is 33122502333503.
It is a cyclic number.
It is not a de Polignac number, because 30533320522133 - 22 = 30533320522129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30533320522093 and 30533320522102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30533320522333) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 979212803 + ... + 979243983.
It is an arithmetic number, because the mean of its divisors is an integer number (1125022175676).
Almost surely, 230533320522133 is an apocalyptic number.
It is an amenable number.
30533320522133 is a deficient number, since it is larger than the sum of its proper divisors (5467389099499).
30533320522133 is a wasteful number, since it uses less digits than its factorization.
30533320522133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55685.
The product of its (nonzero) digits is 145800, while the sum is 35.
Adding to 30533320522133 its reverse (33122502333503), we get a palindrome (63655822855636).
The spelling of 30533320522133 in words is "thirty trillion, five hundred thirty-three billion, three hundred twenty million, five hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •