Base | Representation |
---|---|
bin | 11010001100101110… |
… | …01001001100000000 |
3 | 1100022020111000210000 |
4 | 31012113021030000 |
5 | 212301213431302 |
6 | 10243405440000 |
7 | 1005360464100 |
oct | 150627111400 |
9 | 40266430700 |
10 | 14065373952 |
11 | 5a6859a6a3 |
12 | 2886570000 |
13 | 143201aba6 |
14 | 976053200 |
15 | 574c4831c |
hex | 3465c9300 |
14065373952 has 540 divisors, whose sum is σ = 49623087360. Its totient is φ = 3950456832.
The previous prime is 14065373947. The next prime is 14065373953. The reversal of 14065373952 is 25937356041.
It is a junction number, because it is equal to n+sod(n) for n = 14065373898 and 14065373907.
It is not an unprimeable number, because it can be changed into a prime (14065373953) by changing a digit.
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 59 ways as a sum of consecutive naturals, for example, 110750913 + ... + 110751039.
Almost surely, 214065373952 is an apocalyptic number.
14065373952 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 14065373952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24811543680).
14065373952 is an abundant number, since it is smaller than the sum of its proper divisors (35557713408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14065373952 is a wasteful number, since it uses less digits than its factorization.
14065373952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278 (or 248 counting only the distinct ones).
The product of its (nonzero) digits is 680400, while the sum is 45.
The spelling of 14065373952 in words is "fourteen billion, sixty-five million, three hundred seventy-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •