Base | Representation |
---|---|
bin | 1100110000111111100101… |
… | …0110000010111001100101 |
3 | 1211200210221220221212100221 |
4 | 3030033321112002321211 |
5 | 3314430400403234421 |
6 | 45503550534004341 |
7 | 2646025143634342 |
oct | 314177126027145 |
9 | 54623856855327 |
10 | 14035841461861 |
11 | 452162665644a |
12 | 16a82a6aa66b1 |
13 | 7aa7605b684b |
14 | 3674a46177c9 |
15 | 195187795841 |
hex | cc3f9582e65 |
14035841461861 has 2 divisors, whose sum is σ = 14035841461862. Its totient is φ = 14035841461860.
The previous prime is 14035841461769. The next prime is 14035841461909. The reversal of 14035841461861 is 16816414853041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13613841813636 + 421999648225 = 3689694^2 + 649615^2 .
It is a cyclic number.
It is not a de Polignac number, because 14035841461861 - 29 = 14035841461349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14035841461799 and 14035841461808.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14035841465861) 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, 7017920730930 + 7017920730931.
It is an arithmetic number, because the mean of its divisors is an integer number (7017920730931).
Almost surely, 214035841461861 is an apocalyptic number.
It is an amenable number.
14035841461861 is a deficient number, since it is larger than the sum of its proper divisors (1).
14035841461861 is an equidigital number, since it uses as much as digits as its factorization.
14035841461861 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2211840, while the sum is 52.
The spelling of 14035841461861 in words is "fourteen trillion, thirty-five billion, eight hundred forty-one million, four hundred sixty-one thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •