Base | Representation |
---|---|
bin | 10011101010011011… |
… | …110000100010010110 |
3 | 2000111101212021000010 |
4 | 103222123300202112 |
5 | 321214412430142 |
6 | 13411005101050 |
7 | 1345125442623 |
oct | 235233604226 |
9 | 60441767003 |
10 | 21113014422 |
11 | 8a54823255 |
12 | 4112857786 |
13 | 1cb6164256 |
14 | 104405134a |
15 | 838822e9c |
hex | 4ea6f0896 |
21113014422 has 8 divisors (see below), whose sum is σ = 42226028856. Its totient is φ = 7037671472.
The previous prime is 21113014421. The next prime is 21113014423. The reversal of 21113014422 is 22441031112.
It is an interprime number because it is at equal distance from previous prime (21113014421) and next prime (21113014423).
It is a sphenic number, since it is the product of 3 distinct primes.
21113014422 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21113014421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1759417863 + ... + 1759417874.
It is an arithmetic number, because the mean of its divisors is an integer number (5278253607).
Almost surely, 221113014422 is an apocalyptic number.
21113014422 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21113014422 is a wasteful number, since it uses less digits than its factorization.
21113014422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3518835742.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 21113014422 its reverse (22441031112), we get a palindrome (43554045534).
The spelling of 21113014422 in words is "twenty-one billion, one hundred thirteen million, fourteen thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •