Base | Representation |
---|---|
bin | 11100001010000110… |
… | …110011011100110001 |
3 | 2220001002012221100201 |
4 | 130022012303130301 |
5 | 443404441424313 |
6 | 21520042315201 |
7 | 2120143352314 |
oct | 341206633461 |
9 | 86032187321 |
10 | 30234326833 |
11 | 11905542277 |
12 | 5a394b8b01 |
13 | 2b0aaaa929 |
14 | 166b60497b |
15 | bbe4b40dd |
hex | 70a1b3731 |
30234326833 has 2 divisors, whose sum is σ = 30234326834. Its totient is φ = 30234326832.
The previous prime is 30234326831. The next prime is 30234326861. The reversal of 30234326833 is 33862343203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30212349489 + 21977344 = 173817^2 + 4688^2 .
It is a cyclic number.
It is not a de Polignac number, because 30234326833 - 21 = 30234326831 is a prime.
It is a super-2 number, since 2×302343268332 (a number of 22 digits) contains 22 as substring.
Together with 30234326831, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 30234326792 and 30234326801.
It is not a weakly prime, because it can be changed into another prime (30234326831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15117163416 + 15117163417.
It is an arithmetic number, because the mean of its divisors is an integer number (15117163417).
Almost surely, 230234326833 is an apocalyptic number.
It is an amenable number.
30234326833 is a deficient number, since it is larger than the sum of its proper divisors (1).
30234326833 is an equidigital number, since it uses as much as digits as its factorization.
30234326833 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 186624, while the sum is 37.
The spelling of 30234326833 in words is "thirty billion, two hundred thirty-four million, three hundred twenty-six thousand, eight hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •