Base | Representation |
---|---|
bin | 111110100010110111… |
… | …1010011011011100000 |
3 | 110211200120111212220010 |
4 | 1331011233103123200 |
5 | 4200033341430212 |
6 | 141411503244520 |
7 | 12463266166623 |
oct | 1750557233340 |
9 | 424616455803 |
10 | 134314014432 |
11 | 51a6483a014 |
12 | 220455a9740 |
13 | c88688cbb0 |
14 | 67023dddba |
15 | 376196503c |
hex | 1f45bd36e0 |
134314014432 has 96 divisors (see below), whose sum is σ = 379769499648. Its totient is φ = 41319323136.
The previous prime is 134314014403. The next prime is 134314014449. The reversal of 134314014432 is 234410413431.
It is a tau number, because it is divible by the number of its divisors (96).
It is a self number, because there is not a number n which added to its sum of digits gives 134314014432.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11054953 + ... + 11067095.
It is an arithmetic number, because the mean of its divisors is an integer number (3955932288).
Almost surely, 2134314014432 is an apocalyptic number.
134314014432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134314014432 is an abundant number, since it is smaller than the sum of its proper divisors (245455485216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134314014432 is a wasteful number, since it uses less digits than its factorization.
134314014432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21032 (or 21024 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 134314014432 its reverse (234410413431), we get a palindrome (368724427863).
The spelling of 134314014432 in words is "one hundred thirty-four billion, three hundred fourteen million, fourteen thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •