Base | Representation |
---|---|
bin | 1001101111010010100011… |
… | …00001100011111011001010 |
3 | 2210211100122001211011200202 |
4 | 10313221101201203323022 |
5 | 10301340110110042000 |
6 | 113314224153132202 |
7 | 4340155203212042 |
oct | 467512141437312 |
9 | 83740561734622 |
10 | 21416074690250 |
11 | 6907562934aa9 |
12 | 249a6b40ba062 |
13 | bc46b1295436 |
14 | 5407876bc722 |
15 | 272134341dd5 |
hex | 137a51863eca |
21416074690250 has 64 divisors (see below), whose sum is σ = 40699486893312. Its totient is φ = 8437313800000.
The previous prime is 21416074690247. The next prime is 21416074690253. The reversal of 21416074690250 is 5209647061412.
It is an interprime number because it is at equal distance from previous prime (21416074690247) and next prime (21416074690253).
It is a junction number, because it is equal to n+sod(n) for n = 21416074690195 and 21416074690204.
It is not an unprimeable number, because it can be changed into a prime (21416074690253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2313875 + ... + 6941625.
It is an arithmetic number, because the mean of its divisors is an integer number (635929482708).
Almost surely, 221416074690250 is an apocalyptic number.
It is a pronic number, being equal to 4627750×4627751.
21416074690250 is a deficient number, since it is larger than the sum of its proper divisors (19283412203062).
21416074690250 is a wasteful number, since it uses less digits than its factorization.
21416074690250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4628048 (or 4628038 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 21416074690250 in words is "twenty-one trillion, four hundred sixteen billion, seventy-four million, six hundred ninety thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •