Base | Representation |
---|---|
bin | 11010001011001011… |
… | …01010110101000110 |
3 | 1100021100002010002210 |
4 | 31011211222311012 |
5 | 212234403421200 |
6 | 10242223444250 |
7 | 1005142316322 |
oct | 150545526506 |
9 | 40240063083 |
10 | 14052404550 |
11 | 5a61241588 |
12 | 2882156686 |
13 | 142c4298a2 |
14 | 974438982 |
15 | 573a35650 |
hex | 34596ad46 |
14052404550 has 48 divisors (see below), whose sum is σ = 35209277712. Its totient is φ = 3708672000.
The previous prime is 14052404537. The next prime is 14052404567. The reversal of 14052404550 is 5540425041.
14052404550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 468351 + ... + 497450.
It is an arithmetic number, because the mean of its divisors is an integer number (733526619).
Almost surely, 214052404550 is an apocalyptic number.
14052404550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14052404550 is an abundant number, since it is smaller than the sum of its proper divisors (21156873162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14052404550 is a wasteful number, since it uses less digits than its factorization.
14052404550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965913 (or 965908 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 30.
Adding to 14052404550 its reverse (5540425041), we get a palindrome (19592829591).
The spelling of 14052404550 in words is "fourteen billion, fifty-two million, four hundred four thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •