Base | Representation |
---|---|
bin | 11110011110010000001010… |
… | …011101111000110011101101 |
3 | 122120112012220120210200101020 |
4 | 132132100022131320303231 |
5 | 120031242121242031110 |
6 | 1153012031512004353 |
7 | 40141435561255641 |
oct | 3636201235706355 |
9 | 576465816720336 |
10 | 134020335111405 |
11 | 397807832a3a96 |
12 | 130460570906b9 |
13 | 59a20a92caa02 |
14 | 25148940d6c21 |
15 | 107629a916d70 |
hex | 79e40a778ced |
134020335111405 has 128 divisors (see below), whose sum is σ = 223484093521920. Its totient is φ = 68537682662400.
The previous prime is 134020335111353. The next prime is 134020335111437. The reversal of 134020335111405 is 504111533020431.
It is not a de Polignac number, because 134020335111405 - 210 = 134020335110381 is a prime.
It is a super-2 number, since 2×1340203351114052 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2813815131 + ... + 2813862759.
It is an arithmetic number, because the mean of its divisors is an integer number (1745969480640).
Almost surely, 2134020335111405 is an apocalyptic number.
134020335111405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
134020335111405 is a deficient number, since it is larger than the sum of its proper divisors (89463758410515).
134020335111405 is a wasteful number, since it uses less digits than its factorization.
134020335111405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48171.
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 134020335111405 its reverse (504111533020431), we get a palindrome (638131868131836).
The spelling of 134020335111405 in words is "one hundred thirty-four trillion, twenty billion, three hundred thirty-five million, one hundred eleven thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •