Base | Representation |
---|---|
bin | 1101111001001000000001… |
… | …00010001010010001101001 |
3 | 11000011120011210012212100220 |
4 | 12330210000202022101221 |
5 | 13001013112000101213 |
6 | 144550305530120253 |
7 | 6302113144510011 |
oct | 674440042122151 |
9 | 130146153185326 |
10 | 30550111331433 |
11 | 9809258452551 |
12 | 3514996580089 |
13 | 1407b2b40a115 |
14 | 7788c1a00c41 |
15 | 37ea29e43e23 |
hex | 1bc90088a469 |
30550111331433 has 16 divisors (see below), whose sum is σ = 42138280657920. Its totient is φ = 19664347981824.
The previous prime is 30550111331431. The next prime is 30550111331473. The reversal of 30550111331433 is 33413311105503.
It is not a de Polignac number, because 30550111331433 - 21 = 30550111331431 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30550111331394 and 30550111331403.
It is not an unprimeable number, because it can be changed into a prime (30550111331431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21459960 + ... + 22839222.
It is an arithmetic number, because the mean of its divisors is an integer number (2633642541120).
Almost surely, 230550111331433 is an apocalyptic number.
It is an amenable number.
30550111331433 is a deficient number, since it is larger than the sum of its proper divisors (11588169326487).
30550111331433 is a wasteful number, since it uses less digits than its factorization.
30550111331433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1633888.
The product of its (nonzero) digits is 24300, while the sum is 33.
Adding to 30550111331433 its reverse (33413311105503), we get a palindrome (63963422436936).
The spelling of 30550111331433 in words is "thirty trillion, five hundred fifty billion, one hundred eleven million, three hundred thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •