Base | Representation |
---|---|
bin | 1100110101011001100… |
… | …0001110000111100110 |
3 | 210002010111120122212011 |
4 | 3031112120032013212 |
5 | 12103032041200313 |
6 | 245143131544434 |
7 | 21634003340662 |
oct | 3152630160746 |
9 | 702114518764 |
10 | 220492521958 |
11 | 8556830a265 |
12 | 368965bb11a |
13 | 17a3ba61207 |
14 | a9599738a2 |
15 | 5b0757c93d |
hex | 335660e1e6 |
220492521958 has 4 divisors (see below), whose sum is σ = 330738782940. Its totient is φ = 110246260978.
The previous prime is 220492521943. The next prime is 220492521971. The reversal of 220492521958 is 859125294022.
220492521958 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×2204925219582 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 55123130488 + ... + 55123130491.
It is an arithmetic number, because the mean of its divisors is an integer number (82684695735).
Almost surely, 2220492521958 is an apocalyptic number.
220492521958 is a deficient number, since it is larger than the sum of its proper divisors (110246260982).
220492521958 is a wasteful number, since it uses less digits than its factorization.
220492521958 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110246260981.
The product of its (nonzero) digits is 1036800, while the sum is 49.
The spelling of 220492521958 in words is "two hundred twenty billion, four hundred ninety-two million, five hundred twenty-one thousand, nine hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •