Base | Representation |
---|---|
bin | 11110110010011111101111… |
… | …100000101000111000000101 |
3 | 122202110012121221010110001110 |
4 | 132302133233200220320011 |
5 | 120222040123234023103 |
6 | 1155555055024115233 |
7 | 40344104006665464 |
oct | 3662375740507005 |
9 | 582405557113043 |
10 | 135411452251653 |
11 | 3a167746699276 |
12 | 1322b791465b19 |
13 | 5a733257b9946 |
14 | 2561d40aa09db |
15 | 109c568cd8403 |
hex | 7b27ef828e05 |
135411452251653 has 8 divisors (see below), whose sum is σ = 180576599400000. Its totient is φ = 90260303302208.
The previous prime is 135411452251633. The next prime is 135411452251661. The reversal of 135411452251653 is 356152254114531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 135411452251653 - 210 = 135411452250629 is a prime.
It is a super-2 number, since 2×1354114522516532 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135411452251613) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3499527153 + ... + 3499565846.
It is an arithmetic number, because the mean of its divisors is an integer number (22572074925000).
Almost surely, 2135411452251653 is an apocalyptic number.
It is an amenable number.
135411452251653 is a deficient number, since it is larger than the sum of its proper divisors (45165147148347).
135411452251653 is an equidigital number, since it uses as much as digits as its factorization.
135411452251653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6999099451.
The product of its digits is 2160000, while the sum is 48.
The spelling of 135411452251653 in words is "one hundred thirty-five trillion, four hundred eleven billion, four hundred fifty-two million, two hundred fifty-one thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •