Base | Representation |
---|---|
bin | 11110100001110100000100… |
… | …111010001100011000000000 |
3 | 122121101121120112110022000220 |
4 | 132201310010322030120000 |
5 | 120044244313040113120 |
6 | 1153320303104343040 |
7 | 40165221141113013 |
oct | 3641640472143000 |
9 | 577347515408026 |
10 | 134265055004160 |
11 | 398655432a3543 |
12 | 13085573314a80 |
13 | 59bc1a94a6892 |
14 | 252266b57137a |
15 | 107c81ede9b40 |
hex | 7a1d04e8c600 |
134265055004160 has 160 divisors (see below), whose sum is σ = 429235878931200. Its totient is φ = 35803407310848.
The previous prime is 134265055004117. The next prime is 134265055004189. The reversal of 134265055004160 is 61400550562431.
It is a tau number, because it is divible by the number of its divisors (160).
It is a super-2 number, since 2×1342650550041602 (a number of 29 digits) contains 22 as substring.
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, 623224141 + ... + 623439539.
It is an arithmetic number, because the mean of its divisors is an integer number (2682724243320).
Almost surely, 2134265055004160 is an apocalyptic number.
134265055004160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134265055004160 is an abundant number, since it is smaller than the sum of its proper divisors (294970823927040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134265055004160 is an equidigital number, since it uses as much as digits as its factorization.
134265055004160 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296588 (or 296572 counting only the distinct ones).
The product of its (nonzero) digits is 432000, while the sum is 42.
The spelling of 134265055004160 in words is "one hundred thirty-four trillion, two hundred sixty-five billion, fifty-five million, four thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •