Base | Representation |
---|---|
bin | 11110101000011101001111… |
… | …110000000010011110101100 |
3 | 122200000020221100110000202111 |
4 | 132220131033300002132230 |
5 | 120124234242223314024 |
6 | 1154310123234533404 |
7 | 40243212162346060 |
oct | 3650351760023654 |
9 | 580006840400674 |
10 | 134721577166764 |
11 | 39a21111143215 |
12 | 13139b3b737264 |
13 | 5a23261b95343 |
14 | 253a7b8357aa0 |
15 | 108963da65a94 |
hex | 7a874fc027ac |
134721577166764 has 12 divisors (see below), whose sum is σ = 269443154333584. Its totient is φ = 57737818785744.
The previous prime is 134721577166749. The next prime is 134721577166819. The reversal of 134721577166764 is 467661775127431.
134721577166764 is an admirable number.
It is a super-2 number, since 2×1347215771667642 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 134721577166764.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2405742449379 + ... + 2405742449434.
Almost surely, 2134721577166764 is an apocalyptic number.
134721577166764 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
134721577166764 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134721577166764 is a wasteful number, since it uses less digits than its factorization.
134721577166764 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4811484898824 (or 4811484898822 counting only the distinct ones).
The product of its digits is 248935680, while the sum is 67.
The spelling of 134721577166764 in words is "one hundred thirty-four trillion, seven hundred twenty-one billion, five hundred seventy-seven million, one hundred sixty-six thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •