Base | Representation |
---|---|
bin | 1110000101010010111001… |
… | …10010001011001000010001 |
3 | 11001122112112001010220120002 |
4 | 13002221130302023020101 |
5 | 13024341004320021232 |
6 | 145510343252055345 |
7 | 6344245423042253 |
oct | 702513462131021 |
9 | 131575461126502 |
10 | 30968270860817 |
11 | 995a62a618074 |
12 | 3581a37304555 |
13 | 14383ac033204 |
14 | 790c2d879cd3 |
15 | 38a850c08b62 |
hex | 1c2a5cc8b211 |
30968270860817 has 2 divisors, whose sum is σ = 30968270860818. Its totient is φ = 30968270860816.
The previous prime is 30968270860783. The next prime is 30968270860819. The reversal of 30968270860817 is 71806807286903.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21246789611776 + 9721481249041 = 4609424^2 + 3117929^2 .
It is a cyclic number.
It is not a de Polignac number, because 30968270860817 - 28 = 30968270860561 is a prime.
Together with 30968270860819, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (30968270860819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15484135430408 + 15484135430409.
It is an arithmetic number, because the mean of its divisors is an integer number (15484135430409).
Almost surely, 230968270860817 is an apocalyptic number.
It is an amenable number.
30968270860817 is a deficient number, since it is larger than the sum of its proper divisors (1).
30968270860817 is an equidigital number, since it uses as much as digits as its factorization.
30968270860817 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48771072, while the sum is 65.
The spelling of 30968270860817 in words is "thirty trillion, nine hundred sixty-eight billion, two hundred seventy million, eight hundred sixty thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •