Base | Representation |
---|---|
bin | 11110011111101110111110… |
… | …101101000001000110001001 |
3 | 122120212221200202201200002112 |
4 | 132133232332231001012021 |
5 | 120034424122131133301 |
6 | 1153130510105112105 |
7 | 40152001512041216 |
oct | 3637567655010611 |
9 | 576787622650075 |
10 | 134122143224201 |
11 | 3980a977324a90 |
12 | 1306192a488635 |
13 | 59ab8825ab082 |
14 | 2519791342b0d |
15 | 1078c5875d9bb |
hex | 79fbbeb41189 |
134122143224201 has 16 divisors (see below), whose sum is σ = 152731176559488. Its totient is φ = 116586252499200.
The previous prime is 134122143224171. The next prime is 134122143224219. The reversal of 134122143224201 is 102422341221431.
It is not a de Polignac number, because 134122143224201 - 26 = 134122143224137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134122143224701) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94059440 + ... + 95474721.
It is an arithmetic number, because the mean of its divisors is an integer number (9545698534968).
Almost surely, 2134122143224201 is an apocalyptic number.
134122143224201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134122143224201 is a deficient number, since it is larger than the sum of its proper divisors (18609033335287).
134122143224201 is a wasteful number, since it uses less digits than its factorization.
134122143224201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189536992.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 134122143224201 its reverse (102422341221431), we get a palindrome (236544484445632).
The spelling of 134122143224201 in words is "one hundred thirty-four trillion, one hundred twenty-two billion, one hundred forty-three million, two hundred twenty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •