Base | Representation |
---|---|
bin | 11001111011001111100111… |
… | …000010101110010101000111 |
3 | 112221201102200020002120200221 |
4 | 121323033213002232111013 |
5 | 104421120310000322423 |
6 | 1042301053254045211 |
7 | 33005562461421634 |
oct | 3173174702562507 |
9 | 487642606076627 |
10 | 114022373057863 |
11 | 33370687041326 |
12 | 10956372049807 |
13 | 4b813572b926a |
14 | 20229d87b118b |
15 | d2aeb493be5d |
hex | 67b3e70ae547 |
114022373057863 has 2 divisors, whose sum is σ = 114022373057864. Its totient is φ = 114022373057862.
The previous prime is 114022373057861. The next prime is 114022373057921. The reversal of 114022373057863 is 368750373220411.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 114022373057863 - 21 = 114022373057861 is a prime.
It is a super-2 number, since 2×1140223730578632 (a number of 29 digits) contains 22 as substring.
Together with 114022373057861, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 114022373057863.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (114022373057861) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57011186528931 + 57011186528932.
It is an arithmetic number, because the mean of its divisors is an integer number (57011186528932).
Almost surely, 2114022373057863 is an apocalyptic number.
114022373057863 is a deficient number, since it is larger than the sum of its proper divisors (1).
114022373057863 is an equidigital number, since it uses as much as digits as its factorization.
114022373057863 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5080320, while the sum is 52.
The spelling of 114022373057863 in words is "one hundred fourteen trillion, twenty-two billion, three hundred seventy-three million, fifty-seven thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •