Base | Representation |
---|---|
bin | 11110100100001100000110… |
… | …011110000000100100110110 |
3 | 122121222012220122202120120120 |
4 | 132210030012132000210312 |
5 | 120104433114210134403 |
6 | 1153523300455312410 |
7 | 40213060225061361 |
oct | 3644140636004466 |
9 | 577865818676516 |
10 | 134428289927478 |
11 | 39918799142448 |
12 | 130b112a37b706 |
13 | 5a016c19bbbc1 |
14 | 252a5149610d8 |
15 | 1081bc5882e53 |
hex | 7a4306780936 |
134428289927478 has 8 divisors (see below), whose sum is σ = 268856579854968. Its totient is φ = 44809429975824.
The previous prime is 134428289927471. The next prime is 134428289927497. The reversal of 134428289927478 is 874729982824431.
It is a sphenic number, since it is the product of 3 distinct primes.
134428289927478 is an admirable number.
It is a super-2 number, since 2×1344282899274782 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134428289927471) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11202357493951 + ... + 11202357493962.
It is an arithmetic number, because the mean of its divisors is an integer number (33607072481871).
Almost surely, 2134428289927478 is an apocalyptic number.
134428289927478 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134428289927478 is a wasteful number, since it uses less digits than its factorization.
134428289927478 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22404714987918.
The product of its digits is 3121348608, while the sum is 78.
The spelling of 134428289927478 in words is "one hundred thirty-four trillion, four hundred twenty-eight billion, two hundred eighty-nine million, nine hundred twenty-seven thousand, four hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •