Base | Representation |
---|---|
bin | 1101111000101100001111… |
… | …10000110000100011111001 |
3 | 11000010010200121022120121011 |
4 | 12330112013300300203321 |
5 | 13000242042223310431 |
6 | 144535402145113521 |
7 | 6301044504215143 |
oct | 674260760604371 |
9 | 130103617276534 |
10 | 30535200213241 |
11 | 98029a6518779 |
12 | 3511b149288a1 |
13 | 14065c3111069 |
14 | 777ca9515c93 |
15 | 37e455d39cb1 |
hex | 1bc587c308f9 |
30535200213241 has 2 divisors, whose sum is σ = 30535200213242. Its totient is φ = 30535200213240.
The previous prime is 30535200213211. The next prime is 30535200213307. The reversal of 30535200213241 is 14231200253503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19526102757225 + 11009097456016 = 4418835^2 + 3317996^2 .
It is a cyclic number.
It is not a de Polignac number, because 30535200213241 - 213 = 30535200205049 is a prime.
It is not a weakly prime, because it can be changed into another prime (30535200213211) 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, 15267600106620 + 15267600106621.
It is an arithmetic number, because the mean of its divisors is an integer number (15267600106621).
Almost surely, 230535200213241 is an apocalyptic number.
It is an amenable number.
30535200213241 is a deficient number, since it is larger than the sum of its proper divisors (1).
30535200213241 is an equidigital number, since it uses as much as digits as its factorization.
30535200213241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 30535200213241 its reverse (14231200253503), we get a palindrome (44766400466744).
The spelling of 30535200213241 in words is "thirty trillion, five hundred thirty-five billion, two hundred million, two hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •