Base | Representation |
---|---|
bin | 11010010011011100… |
… | …10001101111011110 |
3 | 1100110011121020112200 |
4 | 31021232101233132 |
5 | 212410133114300 |
6 | 10253142312330 |
7 | 1006644030651 |
oct | 151156215736 |
9 | 40404536480 |
10 | 14121769950 |
11 | 5a97409862 |
12 | 28a14286a6 |
13 | 14409055c2 |
14 | 97d733898 |
15 | 579b88200 |
hex | 349b91bde |
14121769950 has 144 divisors (see below), whose sum is σ = 42287047920. Its totient is φ = 3357711360.
The previous prime is 14121769939. The next prime is 14121769979. The reversal of 14121769950 is 5996712141.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 14121769896 and 14121769905.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 96772 + ... + 193928.
It is an arithmetic number, because the mean of its divisors is an integer number (293660055).
Almost surely, 214121769950 is an apocalyptic number.
14121769950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 14121769950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21143523960).
14121769950 is an abundant number, since it is smaller than the sum of its proper divisors (28165277970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14121769950 is a wasteful number, since it uses less digits than its factorization.
14121769950 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 97211 (or 97203 counting only the distinct ones).
The product of its (nonzero) digits is 136080, while the sum is 45.
The spelling of 14121769950 in words is "fourteen billion, one hundred twenty-one million, seven hundred sixty-nine thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •