Base | Representation |
---|---|
bin | 101111111110011101000101… |
… | …001111110011010110111110 |
3 | 1000200002101221012010222201212 |
4 | 233332131011033303112332 |
5 | 210124011020122333042 |
6 | 2024432023204204422 |
7 | 62305151124523046 |
oct | 5776350517632676 |
9 | 1020071835128655 |
10 | 211000020121022 |
11 | 6125a673665500 |
12 | 1b7b9273999712 |
13 | 90972a7909462 |
14 | 3a16653b16726 |
15 | 195d8dc3c0482 |
hex | bfe7453f35be |
211000020121022 has 12 divisors (see below), whose sum is σ = 347888462927208. Its totient is φ = 95909100054900.
The previous prime is 211000020121021. The next prime is 211000020121027. The reversal of 211000020121022 is 220121020000112.
It is a junction number, because it is equal to n+sod(n) for n = 211000020120988 and 211000020121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211000020121021) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 435950454554 + ... + 435950455037.
It is an arithmetic number, because the mean of its divisors is an integer number (28990705243934).
Almost surely, 2211000020121022 is an apocalyptic number.
211000020121022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
211000020121022 is a deficient number, since it is larger than the sum of its proper divisors (136888442806186).
211000020121022 is a wasteful number, since it uses less digits than its factorization.
211000020121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 871900909615 (or 871900909604 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 211000020121022 its reverse (220121020000112), we get a palindrome (431121040121134).
The spelling of 211000020121022 in words is "two hundred eleven trillion, twenty million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •