Base | Representation |
---|---|
bin | 11010010001011001… |
… | …00000000010000000 |
3 | 1100101222011012122000 |
4 | 31020230200002000 |
5 | 212341224330401 |
6 | 10251324544000 |
7 | 1006344333621 |
oct | 151054400200 |
9 | 40358135560 |
10 | 14104526976 |
11 | 5a88701971 |
12 | 28976b2000 |
13 | 143a179067 |
14 | 97b325a48 |
15 | 5783ce186 |
hex | 348b20080 |
14104526976 has 128 divisors (see below), whose sum is σ = 42249950400. Its totient is φ = 4631261184.
The previous prime is 14104526929. The next prime is 14104526977. The reversal of 14104526976 is 67962540141.
14104526976 is a `hidden beast` number, since 14 + 104 + 526 + 9 + 7 + 6 = 666.
It is a tau number, because it is divible by the number of its divisors (128).
It is not an unprimeable number, because it can be changed into a prime (14104526977) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 201096 + ... + 262008.
Almost surely, 214104526976 is an apocalyptic number.
14104526976 is a gapful number since it is divisible by the number (16) 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 14104526976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21124975200).
14104526976 is an abundant number, since it is smaller than the sum of its proper divisors (28145423424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14104526976 is an equidigital number, since it uses as much as digits as its factorization.
14104526976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61003 (or 60985 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The spelling of 14104526976 in words is "fourteen billion, one hundred four million, five hundred twenty-six thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •