Base | Representation |
---|---|
bin | 101010001101100… |
… | …0111100011000110 |
3 | 10122201012022121020 |
4 | 1110123013203012 |
5 | 10400044114300 |
6 | 352314132010 |
7 | 50046105225 |
oct | 12433074306 |
9 | 3581168536 |
10 | 1416394950 |
11 | 667577543 |
12 | 336421006 |
13 | 19759c029 |
14 | d617ccbc |
15 | 845328a0 |
hex | 546c78c6 |
1416394950 has 144 divisors (see below), whose sum is σ = 3809287440. Its totient is φ = 347043840.
The previous prime is 1416394939. The next prime is 1416394951. The reversal of 1416394950 is 594936141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1416394951) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 15914506 + ... + 15914594.
It is an arithmetic number, because the mean of its divisors is an integer number (26453385).
Almost surely, 21416394950 is an apocalyptic number.
1416394950 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 1416394950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1904643720).
1416394950 is an abundant number, since it is smaller than the sum of its proper divisors (2392892490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1416394950 is a wasteful number, since it uses less digits than its factorization.
1416394950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279 (or 195 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 42.
The square root of 1416394950 is about 37635.0229174900. The cubic root of 1416394950 is about 1123.0388746667.
The spelling of 1416394950 in words is "one billion, four hundred sixteen million, three hundred ninety-four thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •