Base | Representation |
---|---|
bin | 10111010010011100000001… |
… | …001001010011011110110011 |
3 | 111102122110100112220202100222 |
4 | 113102130001021103132303 |
5 | 101411040432201332034 |
6 | 1001500022024203255 |
7 | 30400516140201554 |
oct | 2722340111233663 |
9 | 442573315822328 |
10 | 102422104324019 |
11 | 2a6a8a74830137 |
12 | b5a210b60952b |
13 | 451c4946662cc |
14 | 1b4138340032b |
15 | bc9379a3012e |
hex | 5d27012537b3 |
102422104324019 has 2 divisors, whose sum is σ = 102422104324020. Its totient is φ = 102422104324018.
The previous prime is 102422104323953. The next prime is 102422104324039. The reversal of 102422104324019 is 910423401224201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102422104324019 is a prime.
It is a super-2 number, since 2×1024221043240192 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102422104324019.
It is not a weakly prime, because it can be changed into another prime (102422104324039) 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, 51211052162009 + 51211052162010.
It is an arithmetic number, because the mean of its divisors is an integer number (51211052162010).
Almost surely, 2102422104324019 is an apocalyptic number.
102422104324019 is a deficient number, since it is larger than the sum of its proper divisors (1).
102422104324019 is an equidigital number, since it uses as much as digits as its factorization.
102422104324019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 35.
The spelling of 102422104324019 in words is "one hundred two trillion, four hundred twenty-two billion, one hundred four million, three hundred twenty-four thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •