Base | Representation |
---|---|
bin | 1100110010100011100000… |
… | …1111000110111000011110 |
3 | 1211210101012101211111112002 |
4 | 3030220320033012320132 |
5 | 3320400320100132200 |
6 | 45524144425442302 |
7 | 2650664661145631 |
oct | 314507017067036 |
9 | 54711171744462 |
10 | 14062666411550 |
11 | 4531a41638159 |
12 | 16b1532640392 |
13 | 7b0146c37443 |
14 | 3688cb0cdc18 |
15 | 195c0779dbd5 |
hex | cca383c6e1e |
14062666411550 has 24 divisors (see below), whose sum is σ = 27533220555000. Its totient is φ = 5329010429280.
The previous prime is 14062666411513. The next prime is 14062666411553. The reversal of 14062666411550 is 5511466626041.
14062666411550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 14062666411495 and 14062666411504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14062666411553) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7401402425 + ... + 7401404324.
It is an arithmetic number, because the mean of its divisors is an integer number (1147217523125).
Almost surely, 214062666411550 is an apocalyptic number.
14062666411550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14062666411550 is a deficient number, since it is larger than the sum of its proper divisors (13470554143450).
14062666411550 is a wasteful number, since it uses less digits than its factorization.
14062666411550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14802806780 (or 14802806775 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 47.
The spelling of 14062666411550 in words is "fourteen trillion, sixty-two billion, six hundred sixty-six million, four hundred eleven thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •