Base | Representation |
---|---|
bin | 111110011111010110… |
… | …1111111011000000000 |
3 | 110211101100212210112010 |
4 | 1330332231333120000 |
5 | 4144313213322012 |
6 | 141352054532520 |
7 | 12460336062663 |
oct | 1747655773000 |
9 | 424340783463 |
10 | 134196229632 |
11 | 51a04300603 |
12 | 22012067140 |
13 | c86836034a |
14 | 66d08dd6da |
15 | 375644ac3c |
hex | 1f3eb7f600 |
134196229632 has 80 divisors (see below), whose sum is σ = 358284537072. Its totient is φ = 44634808320.
The previous prime is 134196229631. The next prime is 134196229729. The reversal of 134196229632 is 236922691431.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134196229631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 613338 + ... + 802854.
Almost surely, 2134196229632 is an apocalyptic number.
134196229632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 134196229632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179142268536).
134196229632 is an abundant number, since it is smaller than the sum of its proper divisors (224088307440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134196229632 is an equidigital number, since it uses as much as digits as its factorization.
134196229632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 189999 (or 189983 counting only the distinct ones).
The product of its digits is 839808, while the sum is 48.
The spelling of 134196229632 in words is "one hundred thirty-four billion, one hundred ninety-six million, two hundred twenty-nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •