Base | Representation |
---|---|
bin | 1101110010101110011010… |
… | …11101000000011001101001 |
3 | 10222101112120112222010010012 |
4 | 12321113031131000121221 |
5 | 12433412233004311103 |
6 | 144301301231101305 |
7 | 6250166621562425 |
oct | 671271535003151 |
9 | 128345515863105 |
10 | 30330211010153 |
11 | 9733a7445443a |
12 | 349a246371835 |
13 | 13c0185273812 |
14 | 76bdc0983b85 |
15 | 378e598932d8 |
hex | 1b95cd740669 |
30330211010153 has 2 divisors, whose sum is σ = 30330211010154. Its totient is φ = 30330211010152.
The previous prime is 30330211010137. The next prime is 30330211010171. The reversal of 30330211010153 is 35101011203303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25114961859289 + 5215249150864 = 5011483^2 + 2283692^2 .
It is a cyclic number.
It is not a de Polignac number, because 30330211010153 - 24 = 30330211010137 is a prime.
It is not a weakly prime, because it can be changed into another prime (30330211010173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15165105505076 + 15165105505077.
It is an arithmetic number, because the mean of its divisors is an integer number (15165105505077).
Almost surely, 230330211010153 is an apocalyptic number.
It is an amenable number.
30330211010153 is a deficient number, since it is larger than the sum of its proper divisors (1).
30330211010153 is an equidigital number, since it uses as much as digits as its factorization.
30330211010153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 23.
Adding to 30330211010153 its reverse (35101011203303), we get a palindrome (65431222213456).
The spelling of 30330211010153 in words is "thirty trillion, three hundred thirty billion, two hundred eleven million, ten thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •