Base | Representation |
---|---|
bin | 1101110010111000010101… |
… | …00011010111100101100001 |
3 | 10222102001022022120102022011 |
4 | 12321130022203113211201 |
5 | 12434004131422233312 |
6 | 144303541154112521 |
7 | 6250445511324535 |
oct | 671341243274541 |
9 | 128361268512264 |
10 | 30335531055457 |
11 | 97362544871a1 |
12 | 349b28bb7b741 |
13 | 13c08224cb114 |
14 | 76c367355bc5 |
15 | 37916b967da7 |
hex | 1b970a8d7961 |
30335531055457 has 2 divisors, whose sum is σ = 30335531055458. Its totient is φ = 30335531055456.
The previous prime is 30335531055443. The next prime is 30335531055463. The reversal of 30335531055457 is 75455013553303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24972397623121 + 5363133432336 = 4997239^2 + 2315844^2 .
It is a cyclic number.
It is not a de Polignac number, because 30335531055457 - 219 = 30335530531169 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30335531055457.
It is not a weakly prime, because it can be changed into another prime (30335531055497) 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, 15167765527728 + 15167765527729.
It is an arithmetic number, because the mean of its divisors is an integer number (15167765527729).
Almost surely, 230335531055457 is an apocalyptic number.
It is an amenable number.
30335531055457 is a deficient number, since it is larger than the sum of its proper divisors (1).
30335531055457 is an equidigital number, since it uses as much as digits as its factorization.
30335531055457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7087500, while the sum is 49.
The spelling of 30335531055457 in words is "thirty trillion, three hundred thirty-five billion, five hundred thirty-one million, fifty-five thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •