Base | Representation |
---|---|
bin | 10100011011011010… |
… | …001111000100000101 |
3 | 2002121200000011000021 |
4 | 110123122033010011 |
5 | 324410240330012 |
6 | 14024320415141 |
7 | 1404363602026 |
oct | 243332170405 |
9 | 62550004007 |
10 | 21934698757 |
11 | 9336624914 |
12 | 4301a774b1 |
13 | 20b746a0ba |
14 | 10c1222c4d |
15 | 885a30007 |
hex | 51b68f105 |
21934698757 has 4 divisors (see below), whose sum is σ = 22198972320. Its totient is φ = 21670425196.
The previous prime is 21934698733. The next prime is 21934698763. The reversal of 21934698757 is 75789643912.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21934698757 is a prime.
It is a super-2 number, since 2×219346987572 (a number of 21 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 = 21934698695 and 21934698704.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21934698727) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 132136657 + ... + 132136822.
It is an arithmetic number, because the mean of its divisors is an integer number (5549743080).
Almost surely, 221934698757 is an apocalyptic number.
It is an amenable number.
21934698757 is a deficient number, since it is larger than the sum of its proper divisors (264273563).
21934698757 is an equidigital number, since it uses as much as digits as its factorization.
21934698757 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 264273562.
The product of its digits is 22861440, while the sum is 61.
The spelling of 21934698757 in words is "twenty-one billion, nine hundred thirty-four million, six hundred ninety-eight thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •