Base | Representation |
---|---|
bin | 11110011110010001111010… |
… | …011101101111111000001011 |
3 | 122120112101202112111100201222 |
4 | 132132101322131233320023 |
5 | 120031304443303414034 |
6 | 1153012542153432255 |
7 | 40141533255511625 |
oct | 3636217235577013 |
9 | 576471675440658 |
10 | 134022214123019 |
11 | 39781557a14252 |
12 | 130464a040b68b |
13 | 59a23186932c1 |
14 | 25149d1899c15 |
15 | 107635a87b12e |
hex | 79e47a76fe0b |
134022214123019 has 2 divisors, whose sum is σ = 134022214123020. Its totient is φ = 134022214123018.
The previous prime is 134022214123013. The next prime is 134022214123069. The reversal of 134022214123019 is 910321412220431.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 134022214123019 - 232 = 134017919155723 is a prime.
It is a super-2 number, since 2×1340222141230192 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134022214123019.
It is not a weakly prime, because it can be changed into another prime (134022214123013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 67011107061509 + 67011107061510.
It is an arithmetic number, because the mean of its divisors is an integer number (67011107061510).
Almost surely, 2134022214123019 is an apocalyptic number.
134022214123019 is a deficient number, since it is larger than the sum of its proper divisors (1).
134022214123019 is an equidigital number, since it uses as much as digits as its factorization.
134022214123019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 35.
The spelling of 134022214123019 in words is "one hundred thirty-four trillion, twenty-two billion, two hundred fourteen million, one hundred twenty-three thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •