Base | Representation |
---|---|
bin | 11110100101011001010101… |
… | …100111101010010111111011 |
3 | 122122021010222100112101120120 |
4 | 132211121111213222113323 |
5 | 120112312440343033132 |
6 | 1154025334042424323 |
7 | 40222054324060353 |
oct | 3645312547522773 |
9 | 578233870471516 |
10 | 134511222236667 |
11 | 3994a986285851 |
12 | 131052142020a3 |
13 | 5a0947a4977c3 |
14 | 2530540d21b63 |
15 | 1083e2b4c402c |
hex | 7a56559ea5fb |
134511222236667 has 64 divisors (see below), whose sum is σ = 193352883840000. Its totient is φ = 82877015789568.
The previous prime is 134511222236609. The next prime is 134511222236707. The reversal of 134511222236667 is 766632222115431.
It is not a de Polignac number, because 134511222236667 - 214 = 134511222220283 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (134511222238667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5328641748 + ... + 5328666990.
It is an arithmetic number, because the mean of its divisors is an integer number (3021138810000).
Almost surely, 2134511222236667 is an apocalyptic number.
134511222236667 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
134511222236667 is a deficient number, since it is larger than the sum of its proper divisors (58841661603333).
134511222236667 is a wasteful number, since it uses less digits than its factorization.
134511222236667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33380.
The product of its digits is 4354560, while the sum is 51.
The spelling of 134511222236667 in words is "one hundred thirty-four trillion, five hundred eleven billion, two hundred twenty-two million, two hundred thirty-six thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •