Base | Representation |
---|---|
bin | 111110100001111001… |
… | …0111111110000100101 |
3 | 110211121022012022201102 |
4 | 1331003302333300211 |
5 | 4200002021144010 |
6 | 141404341005445 |
7 | 12462422206514 |
oct | 1750362776045 |
9 | 424538168642 |
10 | 134281428005 |
11 | 51a4840238a |
12 | 220366b3885 |
13 | c87cbc089a |
14 | 66dbd5a67b |
15 | 375db79ba5 |
hex | 1f43cbfc25 |
134281428005 has 4 divisors (see below), whose sum is σ = 161137713612. Its totient is φ = 107425142400.
The previous prime is 134281427953. The next prime is 134281428023. The reversal of 134281428005 is 500824182431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 500824182431 = 383609 ⋅1305559.
It can be written as a sum of positive squares in 2 ways, for example, as 42107860804 + 92173567201 = 205202^2 + 303601^2 .
It is not a de Polignac number, because 134281428005 - 212 = 134281423909 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 134281428005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13428142796 + ... + 13428142805.
It is an arithmetic number, because the mean of its divisors is an integer number (40284428403).
Almost surely, 2134281428005 is an apocalyptic number.
It is an amenable number.
134281428005 is a deficient number, since it is larger than the sum of its proper divisors (26856285607).
134281428005 is an equidigital number, since it uses as much as digits as its factorization.
134281428005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26856285606.
The product of its (nonzero) digits is 61440, while the sum is 38.
The spelling of 134281428005 in words is "one hundred thirty-four billion, two hundred eighty-one million, four hundred twenty-eight thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •