Base | Representation |
---|---|
bin | 111010010011111000001… |
… | …1101000000000011010101 |
3 | 1001101010220202121110001111 |
4 | 1310213300131000003111 |
5 | 2022300433411010034 |
6 | 25013352051455021 |
7 | 1455001030143424 |
oct | 164476035000325 |
9 | 31333822543044 |
10 | 8014148141269 |
11 | 260a865774176 |
12 | a95241bb7471 |
13 | 461966b00b9a |
14 | 1d9c5b6b92bb |
15 | dd6ee0ac364 |
hex | 749f07400d5 |
8014148141269 has 2 divisors, whose sum is σ = 8014148141270. Its totient is φ = 8014148141268.
The previous prime is 8014148141261. The next prime is 8014148141359. The reversal of 8014148141269 is 9621418414108.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7470721160644 + 543426980625 = 2733262^2 + 737175^2 .
It is a cyclic number.
It is not a de Polignac number, because 8014148141269 - 23 = 8014148141261 is a prime.
It is a super-2 number, since 2×80141481412692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8014148141261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4007074070634 + 4007074070635.
It is an arithmetic number, because the mean of its divisors is an integer number (4007074070635).
Almost surely, 28014148141269 is an apocalyptic number.
It is an amenable number.
8014148141269 is a deficient number, since it is larger than the sum of its proper divisors (1).
8014148141269 is an equidigital number, since it uses as much as digits as its factorization.
8014148141269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 442368, while the sum is 49.
The spelling of 8014148141269 in words is "eight trillion, fourteen billion, one hundred forty-eight million, one hundred forty-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •