Base | Representation |
---|---|
bin | 1100010010110111010… |
… | …0110000001010101010 |
3 | 202012012102211120012120 |
4 | 3010231310300022222 |
5 | 11430040340413002 |
6 | 241011212452110 |
7 | 21155166041121 |
oct | 3045564601252 |
9 | 665172746176 |
10 | 211222201002 |
11 | 8164047598a |
12 | 34b29a7a036 |
13 | 16bc22a4cb7 |
14 | a31a6b2ab8 |
15 | 57637a5cbc |
hex | 312dd302aa |
211222201002 has 8 divisors (see below), whose sum is σ = 422444402016. Its totient is φ = 70407400332.
The previous prime is 211222200979. The next prime is 211222201009. The reversal of 211222201002 is 200102222112.
It is a sphenic number, since it is the product of 3 distinct primes.
211222201002 is an admirable number.
It is a super-2 number, since 2×2112222010022 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211222201009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17601850078 + ... + 17601850089.
It is an arithmetic number, because the mean of its divisors is an integer number (52805550252).
Almost surely, 2211222201002 is an apocalyptic number.
211222201002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211222201002 is a wasteful number, since it uses less digits than its factorization.
211222201002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35203700172.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 211222201002 its reverse (200102222112), we get a palindrome (411324423114).
The spelling of 211222201002 in words is "two hundred eleven billion, two hundred twenty-two million, two hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •