Base | Representation |
---|---|
bin | 101111101100010110… |
… | …1101101110001010111 |
3 | 100210100211111200122002 |
4 | 1133120231231301113 |
5 | 3134224022013143 |
6 | 115015014225515 |
7 | 10254031401011 |
oct | 1373055556127 |
9 | 323324450562 |
10 | 102420110423 |
11 | 3a488533964 |
12 | 17a2435529b |
13 | 9873019b47 |
14 | 4d586371b1 |
15 | 29e69345b8 |
hex | 17d8b6dc57 |
102420110423 has 4 divisors (see below), whose sum is σ = 102502908840. Its totient is φ = 102337312008.
The previous prime is 102420110369. The next prime is 102420110431. The reversal of 102420110423 is 324011024201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102420110423 - 226 = 102353001559 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102420110395 and 102420110404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102420110473) 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 in 3 ways as a sum of consecutive naturals, for example, 41397353 + ... + 41399826.
It is an arithmetic number, because the mean of its divisors is an integer number (25625727210).
Almost surely, 2102420110423 is an apocalyptic number.
102420110423 is a deficient number, since it is larger than the sum of its proper divisors (82798417).
102420110423 is an equidigital number, since it uses as much as digits as its factorization.
102420110423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82798416.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 102420110423 its reverse (324011024201), we get a palindrome (426431134624).
The spelling of 102420110423 in words is "one hundred two billion, four hundred twenty million, one hundred ten thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •