Base | Representation |
---|---|
bin | 1110111100000101010011… |
… | …1000011101010101011101 |
3 | 2011011020202220110021211022 |
4 | 3233001110320131111131 |
5 | 4123103134012320034 |
6 | 54533414232533525 |
7 | 3313460130046643 |
oct | 357012470352535 |
9 | 64136686407738 |
10 | 16425379026269 |
11 | 5262a67284944 |
12 | 1a134222512a5 |
13 | 921ba2a39a55 |
14 | 40adc792d193 |
15 | 1d73dd8b5b2e |
hex | ef054e1d55d |
16425379026269 has 2 divisors, whose sum is σ = 16425379026270. Its totient is φ = 16425379026268.
The previous prime is 16425379026239. The next prime is 16425379026271. The reversal of 16425379026269 is 96262097352461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15135251064025 + 1290127962244 = 3890405^2 + 1135838^2 .
It is a cyclic number.
It is not a de Polignac number, because 16425379026269 - 224 = 16425362249053 is a prime.
It is a super-2 number, since 2×164253790262692 (a number of 27 digits) contains 22 as substring.
Together with 16425379026271, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16425379026229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8212689513134 + 8212689513135.
It is an arithmetic number, because the mean of its divisors is an integer number (8212689513135).
Almost surely, 216425379026269 is an apocalyptic number.
It is an amenable number.
16425379026269 is a deficient number, since it is larger than the sum of its proper divisors (1).
16425379026269 is an equidigital number, since it uses as much as digits as its factorization.
16425379026269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 58786560, while the sum is 62.
The spelling of 16425379026269 in words is "sixteen trillion, four hundred twenty-five billion, three hundred seventy-nine million, twenty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •