Base | Representation |
---|---|
bin | 11010101110101010… |
… | …00010110001101001 |
3 | 1101001002010100210112 |
4 | 31113111002301221 |
5 | 213342102123243 |
6 | 10331535024105 |
7 | 1015415202602 |
oct | 152725026151 |
9 | 41032110715 |
10 | 14350036073 |
11 | 60a424854a |
12 | 294596b035 |
13 | 1478ca8609 |
14 | 9a1b92da9 |
15 | 58ec27818 |
hex | 357542c69 |
14350036073 has 16 divisors (see below), whose sum is σ = 15452292240. Its totient is φ = 13276723200.
The previous prime is 14350036037. The next prime is 14350036091. The reversal of 14350036073 is 37063005341.
14350036073 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 8 ways, for example, as 3608164624 + 10741871449 = 60068^2 + 103643^2 .
It is not a de Polignac number, because 14350036073 - 224 = 14333258857 is a prime.
It is a super-2 number, since 2×143500360732 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14350936073) 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, 2528483 + ... + 2534151.
It is an arithmetic number, because the mean of its divisors is an integer number (965768265).
Almost surely, 214350036073 is an apocalyptic number.
It is an amenable number.
14350036073 is a deficient number, since it is larger than the sum of its proper divisors (1102256167).
14350036073 is a wasteful number, since it uses less digits than its factorization.
14350036073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8188.
The product of its (nonzero) digits is 22680, while the sum is 32.
The spelling of 14350036073 in words is "fourteen billion, three hundred fifty million, thirty-six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •