Base | Representation |
---|---|
bin | 1101111000101000101111… |
… | …01110010011100110010011 |
3 | 11000002221211121100101010220 |
4 | 12330110113232103212103 |
5 | 13000224220023202011 |
6 | 144534451440524123 |
7 | 6300650101132140 |
oct | 674242756234623 |
9 | 130087747311126 |
10 | 30533320522131 |
11 | 9802121483a49 |
12 | 351168b320643 |
13 | 140638386b3bb |
14 | 777b6ba173c7 |
15 | 37e395cde506 |
hex | 1bc517b93993 |
30533320522131 has 16 divisors (see below), whose sum is σ = 46528945480704. Its totient is φ = 17446868898624.
The previous prime is 30533320522129. The next prime is 30533320522181. The reversal of 30533320522131 is 13122502333503.
It is a happy number.
It is not a de Polignac number, because 30533320522131 - 21 = 30533320522129 is a prime.
It is a super-2 number, since 2×305333205221312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30533320522092 and 30533320522101.
It is not an unprimeable number, because it can be changed into a prime (30533320522181) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30445995 + ... + 31432868.
It is an arithmetic number, because the mean of its divisors is an integer number (2908059092544).
Almost surely, 230533320522131 is an apocalyptic number.
30533320522131 is a deficient number, since it is larger than the sum of its proper divisors (15995624958573).
30533320522131 is a wasteful number, since it uses less digits than its factorization.
30533320522131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61902370.
The product of its (nonzero) digits is 48600, while the sum is 33.
Adding to 30533320522131 its reverse (13122502333503), we get a palindrome (43655822855634).
The spelling of 30533320522131 in words is "thirty trillion, five hundred thirty-three billion, three hundred twenty million, five hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •