Base | Representation |
---|---|
bin | 101111111110110001100100… |
… | …101111010001010001111110 |
3 | 1000200011111201122000022020211 |
4 | 233332301210233101101332 |
5 | 210124341100431101342 |
6 | 2024450102412503034 |
7 | 62306560312462411 |
oct | 5776614457212176 |
9 | 1020144648008224 |
10 | 211022023300222 |
11 | 61268a34902722 |
12 | 1b80159477aa7a |
13 | 90993a3302514 |
14 | 3a17740083b78 |
15 | 195e278e2ac17 |
hex | bfec64bd147e |
211022023300222 has 4 divisors (see below), whose sum is σ = 316533034950336. Its totient is φ = 105511011650110.
The previous prime is 211022023300199. The next prime is 211022023300229. The reversal of 211022023300222 is 222003320220112.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 211022023300193 and 211022023300202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211022023300229) 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 as a sum of consecutive naturals, namely, 52755505825054 + ... + 52755505825057.
It is an arithmetic number, because the mean of its divisors is an integer number (79133258737584).
Almost surely, 2211022023300222 is an apocalyptic number.
211022023300222 is a deficient number, since it is larger than the sum of its proper divisors (105511011650114).
211022023300222 is a wasteful number, since it uses less digits than its factorization.
211022023300222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105511011650113.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 211022023300222 its reverse (222003320220112), we get a palindrome (433025343520334).
The spelling of 211022023300222 in words is "two hundred eleven trillion, twenty-two billion, twenty-three million, three hundred thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •