Base | Representation |
---|---|
bin | 11110011111001000011011… |
… | …010010001100011000100000 |
3 | 122120201222211210001110122002 |
4 | 132133020123102030120200 |
5 | 120033234332140110142 |
6 | 1153055502244103132 |
7 | 40146004620201620 |
oct | 3637103322143040 |
9 | 576658753043562 |
10 | 134080746800672 |
11 | 397a4364100311 |
12 | 130558b6994aa8 |
13 | 59a79b612cbc9 |
14 | 2517785514880 |
15 | 1077b3438ba32 |
hex | 79f21b48c620 |
134080746800672 has 96 divisors (see below), whose sum is σ = 303530108716800. Its totient is φ = 57112091688960.
The previous prime is 134080746800669. The next prime is 134080746800683. The reversal of 134080746800672 is 276008647080431.
It is a Harshad number since it is a multiple of its sum of digits (56).
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, 23254397 + ... + 28441667.
It is an arithmetic number, because the mean of its divisors is an integer number (3161771965800).
Almost surely, 2134080746800672 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 134080746800672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151765054358400).
134080746800672 is an abundant number, since it is smaller than the sum of its proper divisors (169449361916128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134080746800672 is a wasteful number, since it uses less digits than its factorization.
134080746800672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5187994 (or 5187986 counting only the distinct ones).
The product of its (nonzero) digits is 10838016, while the sum is 56.
The spelling of 134080746800672 in words is "one hundred thirty-four trillion, eighty billion, seven hundred forty-six million, eight hundred thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •