Base | Representation |
---|---|
bin | 1101101100111111001000… |
… | …00001010100011000101011 |
3 | 10221200200121001102102112222 |
4 | 12312133210001110120223 |
5 | 12422144411402213311 |
6 | 144030530243424255 |
7 | 6230016232352435 |
oct | 666374401243053 |
9 | 127620531372488 |
10 | 30133021132331 |
11 | 9668384954667 |
12 | 3467b9398508b |
13 | 13a76bb1b6c40 |
14 | 762635b9d655 |
15 | 373c67ea7adb |
hex | 1b67e405462b |
30133021132331 has 64 divisors (see below), whose sum is σ = 36560524492800. Its totient is φ = 24532834093056.
The previous prime is 30133021132321. The next prime is 30133021132337. The reversal of 30133021132331 is 13323112033103.
It is a cyclic number.
It is not a de Polignac number, because 30133021132331 - 222 = 30133016938027 is a prime.
It is a super-2 number, since 2×301330211323312 (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 30133021132331.
It is not an unprimeable number, because it can be changed into a prime (30133021132337) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 277764206 + ... + 277872668.
It is an arithmetic number, because the mean of its divisors is an integer number (571258195200).
Almost surely, 230133021132331 is an apocalyptic number.
30133021132331 is a deficient number, since it is larger than the sum of its proper divisors (6427503360469).
30133021132331 is a wasteful number, since it uses less digits than its factorization.
30133021132331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109228.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 30133021132331 its reverse (13323112033103), we get a palindrome (43456133165434).
The spelling of 30133021132331 in words is "thirty trillion, one hundred thirty-three billion, twenty-one million, one hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •