Base | Representation |
---|---|
bin | 11110100100001010011100… |
… | …111110010001011011111011 |
3 | 122121222001100022022221212022 |
4 | 132210022130332101123323 |
5 | 120104421003110002001 |
6 | 1153522405111505055 |
7 | 40212665323664603 |
oct | 3644123476213373 |
9 | 577861308287768 |
10 | 134426520000251 |
11 | 39917a70058976 |
12 | 130b091568818b |
13 | 5a0149c0cac9b |
14 | 252a3c7875c03 |
15 | 1081b202ba11b |
hex | 7a429cf916fb |
134426520000251 has 16 divisors (see below), whose sum is σ = 139323737836800. Its totient is φ = 129625709941728.
The previous prime is 134426520000229. The next prime is 134426520000259. The reversal of 134426520000251 is 152000025624431.
It is a cyclic number.
It is not a de Polignac number, because 134426520000251 - 210 = 134426519999227 is a prime.
It is a super-2 number, since 2×1344265200002512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134426520000259) 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, 41557241 + ... + 44675018.
It is an arithmetic number, because the mean of its divisors is an integer number (8707733614800).
Almost surely, 2134426520000251 is an apocalyptic number.
134426520000251 is a deficient number, since it is larger than the sum of its proper divisors (4897217836549).
134426520000251 is an equidigital number, since it uses as much as digits as its factorization.
134426520000251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86232818.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 134426520000251 its reverse (152000025624431), we get a palindrome (286426545624682).
The spelling of 134426520000251 in words is "one hundred thirty-four trillion, four hundred twenty-six billion, five hundred twenty million, two hundred fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •