Base | Representation |
---|---|
bin | 101111111110110000100111… |
… | …110000011111101001001110 |
3 | 1000200011102002022212222201020 |
4 | 233332300213300133221032 |
5 | 210124332002023223042 |
6 | 2024445413104255010 |
7 | 62306523050405151 |
oct | 5776604760375116 |
9 | 1020142068788636 |
10 | 211021000211022 |
11 | 6126855a349661 |
12 | 1b80134a011466 |
13 | 909926c36cab1 |
14 | 3a17684245c98 |
15 | 195e2191d83ec |
hex | bfec27c1fa4e |
211021000211022 has 32 divisors (see below), whose sum is σ = 422940428743680. Its totient is φ = 70190607392640.
The previous prime is 211021000210949. The next prime is 211021000211027. The reversal of 211021000211022 is 220112000120112.
It is a junction number, because it is equal to n+sod(n) for n = 211021000210992 and 211021000211010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211021000211027) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 69187497 + ... + 72173067.
It is an arithmetic number, because the mean of its divisors is an integer number (13216888398240).
Almost surely, 2211021000211022 is an apocalyptic number.
211021000211022 is an abundant number, since it is smaller than the sum of its proper divisors (211919428532658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211021000211022 is a wasteful number, since it uses less digits than its factorization.
211021000211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3010648.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211021000211022 its reverse (220112000120112), we get a palindrome (431133000331134).
The spelling of 211021000211022 in words is "two hundred eleven trillion, twenty-one billion, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •