Base | Representation |
---|---|
bin | 10100100100111011001… |
… | …001011001011001000011 |
3 | 12000011212122020220011020 |
4 | 110210323021121121003 |
5 | 141131421324400202 |
6 | 3001333250520523 |
7 | 204106100303562 |
oct | 24447311313103 |
9 | 5004778226136 |
10 | 1414036559427 |
11 | 4a5764857128 |
12 | 1aa071b96143 |
13 | a345c97653b |
14 | 4c6228bbbd9 |
15 | 26bb05b55bc |
hex | 1493b259643 |
1414036559427 has 8 divisors (see below), whose sum is σ = 1886063471616. Its totient is φ = 942350343432.
The previous prime is 1414036559413. The next prime is 1414036559459. The reversal of 1414036559427 is 7249556304141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1414036559427 - 235 = 1379676821059 is a prime.
It is a super-2 number, since 2×14140365594272 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1414036559427.
It is not an unprimeable number, because it can be changed into a prime (1414036559927) 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 in 7 ways as a sum of consecutive naturals, for example, 85164363 + ... + 85180964.
It is an arithmetic number, because the mean of its divisors is an integer number (235757933952).
Almost surely, 21414036559427 is an apocalyptic number.
1414036559427 is a deficient number, since it is larger than the sum of its proper divisors (472026912189).
1414036559427 is a wasteful number, since it uses less digits than its factorization.
1414036559427 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170348097.
The product of its (nonzero) digits is 3628800, while the sum is 51.
The spelling of 1414036559427 in words is "one trillion, four hundred fourteen billion, thirty-six million, five hundred fifty-nine thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •