Base | Representation |
---|---|
bin | 11010001100000110… |
… | …00000010100011110 |
3 | 1100021212112211002000 |
4 | 31012003000110132 |
5 | 212243341013000 |
6 | 10243100343130 |
7 | 1005264555612 |
oct | 150603002436 |
9 | 40255484060 |
10 | 14060094750 |
11 | 5a65614319 |
12 | 2884844aa6 |
13 | 1430bbccc0 |
14 | 97547b342 |
15 | 574554000 |
hex | 3460c051e |
14060094750 has 256 divisors, whose sum is σ = 42293422080. Its totient is φ = 3436214400.
The previous prime is 14060094743. The next prime is 14060094761. The reversal of 14060094750 is 5749006041.
14060094750 is a `hidden beast` number, since 1 + 4 + 0 + 600 + 9 + 47 + 5 + 0 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 14302759 + ... + 14303741.
It is an arithmetic number, because the mean of its divisors is an integer number (165208680).
Almost surely, 214060094750 is an apocalyptic number.
14060094750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14060094750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21146711040).
14060094750 is an abundant number, since it is smaller than the sum of its proper divisors (28233327330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14060094750 is a wasteful number, since it uses less digits than its factorization.
14060094750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1185 (or 1169 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The spelling of 14060094750 in words is "fourteen billion, sixty million, ninety-four thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •