Base | Representation |
---|---|
bin | 1101110011000111001110… |
… | …11001001101011000011011 |
3 | 10222102210221212010000120101 |
4 | 12321203213121031120123 |
5 | 12434122022431434001 |
6 | 144311343055240231 |
7 | 6251150662642342 |
oct | 671434731153033 |
9 | 128383855100511 |
10 | 30343531124251 |
11 | 973968a2a12a4 |
12 | 34a0943219077 |
13 | 13c14c8a66637 |
14 | 76c8c5a3ab59 |
15 | 379488e78a01 |
hex | 1b98e764d61b |
30343531124251 has 2 divisors, whose sum is σ = 30343531124252. Its totient is φ = 30343531124250.
The previous prime is 30343531124227. The next prime is 30343531124261. The reversal of 30343531124251 is 15242113534303.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30343531124251 - 229 = 30342994253339 is a prime.
It is a super-2 number, since 2×303435311242512 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30343531124251.
It is not a weakly prime, because it can be changed into another prime (30343531124201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15171765562125 + 15171765562126.
It is an arithmetic number, because the mean of its divisors is an integer number (15171765562126).
Almost surely, 230343531124251 is an apocalyptic number.
30343531124251 is a deficient number, since it is larger than the sum of its proper divisors (1).
30343531124251 is an equidigital number, since it uses as much as digits as its factorization.
30343531124251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 30343531124251 its reverse (15242113534303), we get a palindrome (45585644658554).
The spelling of 30343531124251 in words is "thirty trillion, three hundred forty-three billion, five hundred thirty-one million, one hundred twenty-four thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •