Base | Representation |
---|---|
bin | 10111010011001000100111… |
… | …010110100001100110101001 |
3 | 111102211000221210012022120221 |
4 | 113103020213112201212221 |
5 | 101412332014412323301 |
6 | 1001534021415450041 |
7 | 30404132606342146 |
oct | 2723104726414651 |
9 | 442730853168527 |
10 | 102469989964201 |
11 | 2a717307a47382 |
12 | b5ab454386921 |
13 | 4523b5635b042 |
14 | 1b43806dc73cd |
15 | bca72d972da1 |
hex | 5d32275a19a9 |
102469989964201 has 2 divisors, whose sum is σ = 102469989964202. Its totient is φ = 102469989964200.
The previous prime is 102469989964159. The next prime is 102469989964207.
102469989964201 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100051106528025 + 2418883436176 = 10002555^2 + 1555276^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 102469989964201 - 217 = 102469989833129 is a prime.
It is not a weakly prime, because it can be changed into another prime (102469989964207) 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, 51234994982100 + 51234994982101.
It is an arithmetic number, because the mean of its divisors is an integer number (51234994982101).
Almost surely, 2102469989964201 is an apocalyptic number.
It is an amenable number.
102469989964201 is a deficient number, since it is larger than the sum of its proper divisors (1).
102469989964201 is an equidigital number, since it uses as much as digits as its factorization.
102469989964201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120932352, while the sum is 70.
The spelling of 102469989964201 in words is "one hundred two trillion, four hundred sixty-nine billion, nine hundred eighty-nine million, nine hundred sixty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •