Base | Representation |
---|---|
bin | 11010001010111101… |
… | …00011111010010101 |
3 | 1100021012120110002000 |
4 | 31011132203322111 |
5 | 212233414304310 |
6 | 10242115505513 |
7 | 1005120425661 |
oct | 150536437225 |
9 | 40235513060 |
10 | 14050541205 |
11 | 5a60189628 |
12 | 28815b8299 |
13 | 142bc2670c |
14 | 9740b18a1 |
15 | 5737b84c0 |
hex | 3457a3e95 |
14050541205 has 32 divisors (see below), whose sum is σ = 25005179520. Its totient is φ = 7485690240.
The previous prime is 14050541189. The next prime is 14050541221. The reversal of 14050541205 is 50214505041.
14050541205 is a `hidden beast` number, since 1 + 405 + 0 + 54 + 1 + 205 = 666.
It is an interprime number because it is at equal distance from previous prime (14050541189) and next prime (14050541221).
It is not a de Polignac number, because 14050541205 - 24 = 14050541189 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 74050 + ... + 183260.
It is an arithmetic number, because the mean of its divisors is an integer number (781411860).
Almost surely, 214050541205 is an apocalyptic number.
14050541205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14050541205 is a deficient number, since it is larger than the sum of its proper divisors (10954638315).
14050541205 is a wasteful number, since it uses less digits than its factorization.
14050541205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110178 (or 110172 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The spelling of 14050541205 in words is "fourteen billion, fifty million, five hundred forty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •