Base | Representation |
---|---|
bin | 1001111111100100100110… |
… | …00111110111101001001011 |
3 | 2212210211122211202022110121 |
4 | 10333302103013313221023 |
5 | 10340021331334000021 |
6 | 114423225345124111 |
7 | 4425451616325025 |
oct | 477622307675113 |
9 | 85724584668417 |
10 | 21975521000011 |
11 | 7002847781917 |
12 | 256b005629637 |
13 | c3538a23a317 |
14 | 55d899a25015 |
15 | 281978ca6741 |
hex | 13fc931f7a4b |
21975521000011 has 8 divisors (see below), whose sum is σ = 23276725027920. Its totient is φ = 20675264341248.
The previous prime is 21975520999979. The next prime is 21975521000023. The reversal of 21975521000011 is 11000012557912.
It is a happy number.
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 21975521000011 - 25 = 21975520999979 is a prime.
It is a super-2 number, since 2×219755210000112 (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 (21975521000051) 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, 236794521 + ... + 236887306.
It is an arithmetic number, because the mean of its divisors is an integer number (2909590628490).
Almost surely, 221975521000011 is an apocalyptic number.
21975521000011 is a deficient number, since it is larger than the sum of its proper divisors (1301204027909).
21975521000011 is a wasteful number, since it uses less digits than its factorization.
21975521000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473684573.
The product of its (nonzero) digits is 6300, while the sum is 34.
Adding to 21975521000011 its reverse (11000012557912), we get a palindrome (32975533557923).
The spelling of 21975521000011 in words is "twenty-one trillion, nine hundred seventy-five billion, five hundred twenty-one million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •