Base | Representation |
---|---|
bin | 1101110010001011000100… |
… | …01110010101100000001100 |
3 | 10222022201120212212021021001 |
4 | 12321011202032111200030 |
5 | 12433104400411230012 |
6 | 144244442055550044 |
7 | 6245625406023436 |
oct | 671054216254014 |
9 | 128281525767231 |
10 | 30311232133132 |
11 | 9726a15366205 |
12 | 349662a38b324 |
13 | 13bb44c2c0682 |
14 | 76b100147656 |
15 | 3786e85cc357 |
hex | 1b916239580c |
30311232133132 has 12 divisors (see below), whose sum is σ = 53044730839800. Its totient is φ = 15155594750336.
The previous prime is 30311232133129. The next prime is 30311232133163. The reversal of 30311232133132 is 23133123211303.
It is a happy number.
It is a super-2 number, since 2×303112321331322 (a number of 28 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 30311232133132.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1881838 + ... + 8010229.
It is an arithmetic number, because the mean of its divisors is an integer number (4420394236650).
Almost surely, 230311232133132 is an apocalyptic number.
It is an amenable number.
30311232133132 is a deficient number, since it is larger than the sum of its proper divisors (22733498706668).
30311232133132 is a wasteful number, since it uses less digits than its factorization.
30311232133132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10658120 (or 10658118 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 30311232133132 its reverse (23133123211303), we get a palindrome (53444355344435).
The spelling of 30311232133132 in words is "thirty trillion, three hundred eleven billion, two hundred thirty-two million, one hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •