Base | Representation |
---|---|
bin | 11010100011100000… |
… | …10111011011001100 |
3 | 1100210120012000202212 |
4 | 31101300113123030 |
5 | 213144133111434 |
6 | 10314355005552 |
7 | 1013201356460 |
oct | 152160273314 |
9 | 40716160685 |
10 | 14256535244 |
11 | 6056495a36 |
12 | 291a5998b8 |
13 | 14627cc093 |
14 | 9935b44a0 |
15 | 5869088ce |
hex | 351c176cc |
14256535244 has 12 divisors (see below), whose sum is σ = 28513070544. Its totient is φ = 6109943664.
The previous prime is 14256535217. The next prime is 14256535247. The reversal of 14256535244 is 44253565241.
14256535244 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
14256535244 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (14256535247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 254580959 + ... + 254581014.
It is an arithmetic number, because the mean of its divisors is an integer number (2376089212).
Almost surely, 214256535244 is an apocalyptic number.
14256535244 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
14256535244 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.
14256535244 is a wasteful number, since it uses less digits than its factorization.
14256535244 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509161984 (or 509161982 counting only the distinct ones).
The product of its digits is 576000, while the sum is 41.
The spelling of 14256535244 in words is "fourteen billion, two hundred fifty-six million, five hundred thirty-five thousand, two hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •