Base | Representation |
---|---|
bin | 101111101011111000… |
… | …0010110010001111111 |
3 | 100210022201020101102021 |
4 | 1133113300112101333 |
5 | 3134210412222143 |
6 | 115013241341011 |
7 | 10253444560102 |
oct | 1372760262177 |
9 | 323281211367 |
10 | 102404023423 |
11 | 3a47a446519 |
12 | 17a1aa97767 |
13 | 986c8a6800 |
14 | 4d5644a739 |
15 | 29e5307ced |
hex | 17d7c1647f |
102404023423 has 12 divisors (see below), whose sum is σ = 113246507808. Its totient is φ = 92515575360.
The previous prime is 102404023391. The next prime is 102404023429. The reversal of 102404023423 is 324320404201.
It is a happy number.
It is not a de Polignac number, because 102404023423 - 25 = 102404023391 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102404023429) 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 11 ways as a sum of consecutive naturals, for example, 6438238 + ... + 6454123.
It is an arithmetic number, because the mean of its divisors is an integer number (9437208984).
Almost surely, 2102404023423 is an apocalyptic number.
102404023423 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102404023423 is a deficient number, since it is larger than the sum of its proper divisors (10842484385).
102404023423 is a wasteful number, since it uses less digits than its factorization.
102404023423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12892434 (or 12892421 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 102404023423 its reverse (324320404201), we get a palindrome (426724427624).
The spelling of 102404023423 in words is "one hundred two billion, four hundred four million, twenty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •