Base | Representation |
---|---|
bin | 1101101010000101110010… |
… | …11010010010101110010111 |
3 | 10221100011202210021100201020 |
4 | 12311002321122102232113 |
5 | 12414032123113323111 |
6 | 143513113132132223 |
7 | 6216564446650620 |
oct | 665027132225627 |
9 | 127304683240636 |
10 | 30033522011031 |
11 | 962a166226100 |
12 | 3450845907073 |
13 | 139b1c23a9536 |
14 | 75b8b7482a47 |
15 | 371392c0b906 |
hex | 1b50b9692b97 |
30033522011031 has 96 divisors (see below), whose sum is σ = 50765772288000. Its totient is φ = 15459149376000.
The previous prime is 30033522011011. The next prime is 30033522011081. The reversal of 30033522011031 is 13011022533003.
It is not a de Polignac number, because 30033522011031 - 27 = 30033522010903 is a prime.
It is a super-2 number, since 2×300335220110312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30033522010992 and 30033522011010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30033522011011) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 154754106 + ... + 154948056.
It is an arithmetic number, because the mean of its divisors is an integer number (528810128000).
Almost surely, 230033522011031 is an apocalyptic number.
30033522011031 is a deficient number, since it is larger than the sum of its proper divisors (20732250276969).
30033522011031 is a wasteful number, since it uses less digits than its factorization.
30033522011031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194541 (or 194530 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 24.
Adding to 30033522011031 its reverse (13011022533003), we get a palindrome (43044544544034).
The spelling of 30033522011031 in words is "thirty trillion, thirty-three billion, five hundred twenty-two million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •