Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …00011110010000100011 |
3 | 10122110212121020022111102 |
4 | 32333112320132100203 |
5 | 113334122142440341 |
6 | 2105120015305015 |
7 | 134264616116345 |
oct | 16772670362043 |
9 | 3573777208442 |
10 | 1030102311971 |
11 | 36795599a477 |
12 | 14778321b16b |
13 | 761a4903865 |
14 | 37c002c5295 |
15 | 1bbde34ec9b |
hex | efd6e1e423 |
1030102311971 has 2 divisors, whose sum is σ = 1030102311972. Its totient is φ = 1030102311970.
The previous prime is 1030102311929. The next prime is 1030102312079. The reversal of 1030102311971 is 1791132010301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1030102311971 - 214 = 1030102295587 is a prime.
It is a super-2 number, since 2×10301023119712 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (1030102361971) 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, 515051155985 + 515051155986.
It is an arithmetic number, because the mean of its divisors is an integer number (515051155986).
Almost surely, 21030102311971 is an apocalyptic number.
1030102311971 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030102311971 is an equidigital number, since it uses as much as digits as its factorization.
1030102311971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 29.
The spelling of 1030102311971 in words is "one trillion, thirty billion, one hundred two million, three hundred eleven thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •