Base | Representation |
---|---|
bin | 111110101111000100… |
… | …1111011011010000000 |
3 | 110212202010022101021120 |
4 | 1331132021323122000 |
5 | 4201403223201404 |
6 | 141520255152240 |
7 | 12506402051154 |
oct | 1753611733200 |
9 | 425663271246 |
10 | 134723647104 |
11 | 52154a94112 |
12 | 2213a815680 |
13 | c9206c4aa7 |
14 | 6740991064 |
15 | 37878cc9d9 |
hex | 1f5e27b680 |
134723647104 has 64 divisors (see below), whose sum is σ = 359133497280. Its totient is φ = 44748032000.
The previous prime is 134723647063. The next prime is 134723647117. The reversal of 134723647104 is 401746327431.
134723647104 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1347236471042 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 516372 + ... + 732179.
It is an arithmetic number, because the mean of its divisors is an integer number (5611460895).
Almost surely, 2134723647104 is an apocalyptic number.
It is an amenable number.
134723647104 is an abundant number, since it is smaller than the sum of its proper divisors (224409850176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134723647104 is a wasteful number, since it uses less digits than its factorization.
134723647104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1248849 (or 1248837 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 42.
The spelling of 134723647104 in words is "one hundred thirty-four billion, seven hundred twenty-three million, six hundred forty-seven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •