Base | Representation |
---|---|
bin | 1101110010110001111101… |
… | …01001001000001100011011 |
3 | 10222101201110220021110120210 |
4 | 12321120332221020030123 |
5 | 12433430130130410321 |
6 | 144302213505222203 |
7 | 6250264651050456 |
oct | 671307651101433 |
9 | 128351426243523 |
10 | 30332110013211 |
11 | 9734859389556 |
12 | 349a696331963 |
13 | 13c03c8818676 |
14 | 76c120c6c49d |
15 | 37901b455b76 |
hex | 1b963ea4831b |
30332110013211 has 8 divisors (see below), whose sum is σ = 42821802371664. Its totient is φ = 19031912165120.
The previous prime is 30332110013209. The next prime is 30332110013251. The reversal of 30332110013211 is 11231001123303.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30332110013211 - 21 = 30332110013209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (30332110013201) 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 7 ways as a sum of consecutive naturals, for example, 297373627530 + ... + 297373627631.
It is an arithmetic number, because the mean of its divisors is an integer number (5352725296458).
Almost surely, 230332110013211 is an apocalyptic number.
30332110013211 is a deficient number, since it is larger than the sum of its proper divisors (12489692358453).
30332110013211 is a wasteful number, since it uses less digits than its factorization.
30332110013211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 594747255181.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 30332110013211 its reverse (11231001123303), we get a palindrome (41563111136514).
The spelling of 30332110013211 in words is "thirty trillion, three hundred thirty-two billion, one hundred ten million, thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •