Base | Representation |
---|---|
bin | 101111111110110000101000… |
… | …011110010100000010101000 |
3 | 1000200011102010011111012211201 |
4 | 233332300220132110002220 |
5 | 210124332013112101440 |
6 | 2024445414213533544 |
7 | 62306523254452012 |
oct | 5776605036240250 |
9 | 1020142104435751 |
10 | 211021012222120 |
11 | 61268566102791 |
12 | 1b8013520442b4 |
13 | 90992719b6b59 |
14 | 3a17685a911b2 |
15 | 195e21a2ac19a |
hex | bfec287940a8 |
211021012222120 has 64 divisors (see below), whose sum is σ = 491786061258240. Its totient is φ = 81406762694400.
The previous prime is 211021012222087. The next prime is 211021012222157. The reversal of 211021012222120 is 21222210120112.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 290043226 + ... + 290769865.
It is an arithmetic number, because the mean of its divisors is an integer number (7684157207160).
Almost surely, 2211021012222120 is an apocalyptic number.
211021012222120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211021012222120 is an abundant number, since it is smaller than the sum of its proper divisors (280765049036120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211021012222120 is a wasteful number, since it uses less digits than its factorization.
211021012222120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 580813426 (or 580813422 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 211021012222120 its reverse (21222210120112), we get a palindrome (232243222342232).
The spelling of 211021012222120 in words is "two hundred eleven trillion, twenty-one billion, twelve million, two hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •