Base | Representation |
---|---|
bin | 11100001000110110… |
… | …011000010010000001 |
3 | 2212222121112211012021 |
4 | 130020312120102001 |
5 | 443334042302113 |
6 | 21514010401441 |
7 | 2116466223400 |
oct | 341066302201 |
9 | 85877484167 |
10 | 30213244033 |
11 | 118a4652475 |
12 | 5a32430281 |
13 | 2b066086bb |
14 | 16688b7637 |
15 | bbc6ec48d |
hex | 708d98481 |
30213244033 has 72 divisors (see below), whose sum is σ = 38301811200. Its totient is φ = 23752415232.
The previous prime is 30213244027. The next prime is 30213244051. The reversal of 30213244033 is 33044231203.
It is a de Polignac number, because none of the positive numbers 2k-30213244033 is a prime.
It is a super-2 number, since 2×302132440332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30213243989 and 30213244007.
It is not an unprimeable number, because it can be changed into a prime (30213244433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 126415128 + ... + 126415366.
It is an arithmetic number, because the mean of its divisors is an integer number (531969600).
Almost surely, 230213244033 is an apocalyptic number.
It is an amenable number.
30213244033 is a deficient number, since it is larger than the sum of its proper divisors (8088567167).
30213244033 is a wasteful number, since it uses less digits than its factorization.
30213244033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479 (or 455 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 25.
Adding to 30213244033 its reverse (33044231203), we get a palindrome (63257475236).
The spelling of 30213244033 in words is "thirty billion, two hundred thirteen million, two hundred forty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •