Base | Representation |
---|---|
bin | 1001110101000110000111… |
… | …00010100101000000001011 |
3 | 2211112102112021012110110002 |
4 | 10322203003202211000023 |
5 | 10313122124322230201 |
6 | 113550014355113215 |
7 | 4360446425636060 |
oct | 472430342450013 |
9 | 84472467173402 |
10 | 21615556055051 |
11 | 6984118970972 |
12 | 25112a5ba280b |
13 | c0a45200637a |
14 | 54a2ac956c67 |
15 | 27740bebb76b |
hex | 13a8c38a500b |
21615556055051 has 8 divisors (see below), whose sum is σ = 24718347423744. Its totient is φ = 18516478383720.
The previous prime is 21615556055047. The next prime is 21615556055059. The reversal of 21615556055051 is 15055065551612.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21615556055051 - 22 = 21615556055047 is a prime.
It is a super-2 number, since 2×216155560550512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21615556054987 and 21615556055005.
It is not an unprimeable number, because it can be changed into a prime (21615556055059) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 928411865 + ... + 928435146.
It is an arithmetic number, because the mean of its divisors is an integer number (3089793427968).
Almost surely, 221615556055051 is an apocalyptic number.
21615556055051 is a deficient number, since it is larger than the sum of its proper divisors (3102791368693).
21615556055051 is a wasteful number, since it uses less digits than its factorization.
21615556055051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1856848681.
The product of its (nonzero) digits is 1125000, while the sum is 47.
The spelling of 21615556055051 in words is "twenty-one trillion, six hundred fifteen billion, five hundred fifty-six million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •