Base | Representation |
---|---|
bin | 11110100111101011010110… |
… | …010011111011010011110000 |
3 | 122122211010122110211102001000 |
4 | 132213223112103323103300 |
5 | 120122400031014143142 |
6 | 1154225343013242000 |
7 | 40236304404241236 |
oct | 3647532623732360 |
9 | 578733573742030 |
10 | 134668000146672 |
11 | 39a00418328013 |
12 | 1312b688933300 |
13 | 5a1b1a40300a5 |
14 | 2537d7493a956 |
15 | 108805514d14c |
hex | 7a7ad64fb4f0 |
134668000146672 has 160 divisors (see below), whose sum is σ = 398417455365120. Its totient is φ = 43531562592000.
The previous prime is 134668000146451. The next prime is 134668000146707. The reversal of 134668000146672 is 276641000866431.
134668000146672 is a `hidden beast` number, since 1 + 3 + 466 + 80 + 0 + 0 + 1 + 46 + 67 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34117404 + ... + 37859387.
It is an arithmetic number, because the mean of its divisors is an integer number (2490109096032).
Almost surely, 2134668000146672 is an apocalyptic number.
134668000146672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134668000146672 is an abundant number, since it is smaller than the sum of its proper divisors (263749455218448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134668000146672 is a wasteful number, since it uses less digits than its factorization.
134668000146672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71976940 (or 71976928 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 54.
The spelling of 134668000146672 in words is "one hundred thirty-four trillion, six hundred sixty-eight billion, one hundred forty-six thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •