Base | Representation |
---|---|
bin | 11111000100101111001111… |
… | …010111100101000110111001 |
3 | 122220220001100212010211111111 |
4 | 133010233033113211012321 |
5 | 120403110002111101231 |
6 | 1202355015414200321 |
7 | 40533503115265213 |
oct | 3704571727450671 |
9 | 586801325124444 |
10 | 136665043456441 |
11 | 3a6003571a9755 |
12 | 133b27266530a1 |
13 | 5b345c5b650c6 |
14 | 25a68a28595b3 |
15 | 10bee8878e4b1 |
hex | 7c4bcf5e51b9 |
136665043456441 has 4 divisors (see below), whose sum is σ = 136665988771572. Its totient is φ = 136664098141312.
The previous prime is 136665043456393. The next prime is 136665043456471. The reversal of 136665043456441 is 144654340566631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 38484293152041 + 98180750304400 = 6203571^2 + 9908620^2 .
It is a cyclic number.
It is not a de Polignac number, because 136665043456441 - 27 = 136665043456313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136665043456471) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 472440676 + ... + 472729861.
It is an arithmetic number, because the mean of its divisors is an integer number (34166497192893).
Almost surely, 2136665043456441 is an apocalyptic number.
It is an amenable number.
136665043456441 is a deficient number, since it is larger than the sum of its proper divisors (945315131).
136665043456441 is an equidigital number, since it uses as much as digits as its factorization.
136665043456441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 945315130.
The product of its (nonzero) digits is 74649600, while the sum is 58.
The spelling of 136665043456441 in words is "one hundred thirty-six trillion, six hundred sixty-five billion, forty-three million, four hundred fifty-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •