Base | Representation |
---|---|
bin | 11010001001001110… |
… | …10100111000110110 |
3 | 1100020012022210222220 |
4 | 31010213110320312 |
5 | 212221212434000 |
6 | 10240441303210 |
7 | 1004553361554 |
oct | 150447247066 |
9 | 40205283886 |
10 | 14036061750 |
11 | 5a52a99a37 |
12 | 2878794b06 |
13 | 1428c26ca9 |
14 | 9721c2bd4 |
15 | 5723a81a0 |
hex | 3449d4e36 |
14036061750 has 32 divisors (see below), whose sum is σ = 35034012000. Its totient is φ = 3742949600.
The previous prime is 14036061749. The next prime is 14036061757. The reversal of 14036061750 is 5716063041.
14036061750 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×140360617502 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14036061757) 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 15 ways as a sum of consecutive naturals, for example, 9356625 + ... + 9358124.
It is an arithmetic number, because the mean of its divisors is an integer number (1094812875).
Almost surely, 214036061750 is an apocalyptic number.
14036061750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14036061750 is an abundant number, since it is smaller than the sum of its proper divisors (20997950250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14036061750 is a wasteful number, since it uses less digits than its factorization.
14036061750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18714769 (or 18714759 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 33.
The spelling of 14036061750 in words is "fourteen billion, thirty-six million, sixty-one thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •