Base | Representation |
---|---|
bin | 1001110101000111000010… |
… | …00010101010001101001001 |
3 | 2211112110210202112111002021 |
4 | 10322203201002222031021 |
5 | 10313124133024113413 |
6 | 113550135435404441 |
7 | 4360464615635440 |
oct | 472434102521511 |
9 | 84473722474067 |
10 | 21616051004233 |
11 | 6984352298584 |
12 | 25114038b3721 |
13 | c0a5007104ca |
14 | 54a318595d57 |
15 | 27743a68818d |
hex | 13a8e10aa349 |
21616051004233 has 16 divisors (see below), whose sum is σ = 25448387411584. Its totient is φ = 17972822609280.
The previous prime is 21616051004227. The next prime is 21616051004269. The reversal of 21616051004233 is 33240015061612.
It is not a de Polignac number, because 21616051004233 - 29 = 21616051003721 is a prime.
It is a super-2 number, since 2×216160510042332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21616051004033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 125986260 + ... + 126157717.
It is an arithmetic number, because the mean of its divisors is an integer number (1590524213224).
Almost surely, 221616051004233 is an apocalyptic number.
It is an amenable number.
21616051004233 is a deficient number, since it is larger than the sum of its proper divisors (3832336407351).
21616051004233 is a wasteful number, since it uses less digits than its factorization.
21616051004233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252144352.
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 21616051004233 its reverse (33240015061612), we get a palindrome (54856066065845).
The spelling of 21616051004233 in words is "twenty-one trillion, six hundred sixteen billion, fifty-one million, four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •