Base | Representation |
---|---|
bin | 11100011100101100… |
… | …100101100001001101 |
3 | 2220211211002210220110 |
4 | 130130230211201031 |
5 | 1000024313034013 |
6 | 22011023310233 |
7 | 2130651411201 |
oct | 343454454115 |
9 | 86754083813 |
10 | 30546221133 |
11 | 11a5560005a |
12 | 5b05a4b379 |
13 | 2b5a5b157c |
14 | 169abd2b01 |
15 | bdba722c3 |
hex | 71cb2584d |
30546221133 has 64 divisors (see below), whose sum is σ = 43937095680. Its totient is φ = 18834816000.
The previous prime is 30546221113. The next prime is 30546221213. The reversal of 30546221133 is 33112264503.
It is not a de Polignac number, because 30546221133 - 28 = 30546220877 is a prime.
It is a super-2 number, since 2×305462211332 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30546221133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30546221113) 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 63 ways as a sum of consecutive naturals, for example, 62212018 + ... + 62212508.
It is an arithmetic number, because the mean of its divisors is an integer number (686517120).
Almost surely, 230546221133 is an apocalyptic number.
It is an amenable number.
30546221133 is a deficient number, since it is larger than the sum of its proper divisors (13390874547).
30546221133 is a wasteful number, since it uses less digits than its factorization.
30546221133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 810.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 30546221133 its reverse (33112264503), we get a palindrome (63658485636).
The spelling of 30546221133 in words is "thirty billion, five hundred forty-six million, two hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •