Base | Representation |
---|---|
bin | 101111101111111010110001… |
… | …100100001011001110011110 |
3 | 1000112112220120102120012222111 |
4 | 233233322301210023032132 |
5 | 210011124233131133042 |
6 | 2022345102250104234 |
7 | 62143036163003035 |
oct | 5757726144131636 |
9 | 1015486512505874 |
10 | 210001110021022 |
11 | 60a04a74986611 |
12 | 1b677756a1b07a |
13 | 9024034396378 |
14 | 39c017233d71c |
15 | 1942926697517 |
hex | befeb190b39e |
210001110021022 has 8 divisors (see below), whose sum is σ = 315069218480016. Its totient is φ = 104978037194352.
The previous prime is 210001110020969. The next prime is 210001110021049. The reversal of 210001110021022 is 220120011100012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2100011100210222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210001110020993 and 210001110021011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11258896423 + ... + 11258915074.
It is an arithmetic number, because the mean of its divisors is an integer number (39383652310002).
Almost surely, 2210001110021022 is an apocalyptic number.
210001110021022 is a deficient number, since it is larger than the sum of its proper divisors (105068108458994).
210001110021022 is a wasteful number, since it uses less digits than its factorization.
210001110021022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22517816162.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210001110021022 its reverse (220120011100012), we get a palindrome (430121121121034).
The spelling of 210001110021022 in words is "two hundred ten trillion, one billion, one hundred ten million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •