Base | Representation |
---|---|
bin | 11110101010010001011110… |
… | …000001111000000011110001 |
3 | 122200110012001102122011221010 |
4 | 132222101132001320003301 |
5 | 120133310331404302111 |
6 | 1154443322331021133 |
7 | 40255220526461364 |
oct | 3652213601700361 |
9 | 580405042564833 |
10 | 134846370775281 |
11 | 39a6a02a957370 |
12 | 1315a16889a7a9 |
13 | 5a31c5c226a49 |
14 | 25428561980db |
15 | 108c9e47a4aa6 |
hex | 7aa45e0780f1 |
134846370775281 has 64 divisors (see below), whose sum is σ = 201166314725376. Its totient is φ = 79645728921600.
The previous prime is 134846370775271. The next prime is 134846370775349. The reversal of 134846370775281 is 182577073648431.
It is a happy number.
It is not a de Polignac number, because 134846370775281 - 218 = 134846370513137 is a prime.
It is a super-2 number, since 2×1348463707752812 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (134846370775231) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5613207436 + ... + 5613231458.
It is an arithmetic number, because the mean of its divisors is an integer number (3143223667584).
Almost surely, 2134846370775281 is an apocalyptic number.
134846370775281 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
134846370775281 is a deficient number, since it is larger than the sum of its proper divisors (66319943950095).
134846370775281 is a wasteful number, since it uses less digits than its factorization.
134846370775281 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39342.
The product of its (nonzero) digits is 189665280, while the sum is 66.
The spelling of 134846370775281 in words is "one hundred thirty-four trillion, eight hundred forty-six billion, three hundred seventy million, seven hundred seventy-five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •