Base | Representation |
---|---|
bin | 10111001100011100010100… |
… | …010110110011110011011001 |
3 | 111101012001220221110221211121 |
4 | 113030130110112303303121 |
5 | 101332313201100132334 |
6 | 1000542444131125241 |
7 | 30325662421241251 |
oct | 2714342426636331 |
9 | 441161827427747 |
10 | 102010109770969 |
11 | 2a55a276627584 |
12 | b5362ab443821 |
13 | 44bc68704c7ca |
14 | 1b2945c23a961 |
15 | bbd7b50dedb4 |
hex | 5cc7145b3cd9 |
102010109770969 has 2 divisors, whose sum is σ = 102010109770970. Its totient is φ = 102010109770968.
The previous prime is 102010109770967. The next prime is 102010109770991. The reversal of 102010109770969 is 969077901010201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100173575255625 + 1836534515344 = 10008675^2 + 1355188^2 .
It is a cyclic number.
It is not a de Polignac number, because 102010109770969 - 21 = 102010109770967 is a prime.
It is a super-2 number, since 2×1020101097709692 (a number of 29 digits) contains 22 as substring.
Together with 102010109770967, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (102010109770967) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005054885484 + 51005054885485.
It is an arithmetic number, because the mean of its divisors is an integer number (51005054885485).
Almost surely, 2102010109770969 is an apocalyptic number.
It is an amenable number.
102010109770969 is a deficient number, since it is larger than the sum of its proper divisors (1).
102010109770969 is an equidigital number, since it uses as much as digits as its factorization.
102010109770969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 428652, while the sum is 52.
The spelling of 102010109770969 in words is "one hundred two trillion, ten billion, one hundred nine million, seven hundred seventy thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •