Base | Representation |
---|---|
bin | 11010000111001110… |
… | …10101000100111001 |
3 | 1100012000202111001002 |
4 | 31003213111010321 |
5 | 212202414112210 |
6 | 10235041534345 |
7 | 1004260646624 |
oct | 150347250471 |
9 | 40160674032 |
10 | 14019285305 |
11 | 5a44580603 |
12 | 28730443b5 |
13 | 1425601bbc |
14 | 96dc96dbb |
15 | 570b924a5 |
hex | 3439d5139 |
14019285305 has 12 divisors (see below), whose sum is σ = 16991419116. Its totient is φ = 11104344000.
The previous prime is 14019285283. The next prime is 14019285307. The reversal of 14019285305 is 50358291041.
It is a happy number.
14019285305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 1824058681 + 12195226624 = 42709^2 + 110432^2 .
It is a de Polignac number, because none of the positive numbers 2k-14019285305 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14019285307) 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 11 ways as a sum of consecutive naturals, for example, 86426 + ... + 188435.
It is an arithmetic number, because the mean of its divisors is an integer number (1415951593).
Almost surely, 214019285305 is an apocalyptic number.
It is an amenable number.
14019285305 is a deficient number, since it is larger than the sum of its proper divisors (2972133811).
14019285305 is an equidigital number, since it uses as much as digits as its factorization.
14019285305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275068 (or 274967 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 38.
The spelling of 14019285305 in words is "fourteen billion, nineteen million, two hundred eighty-five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •