Base | Representation |
---|---|
bin | 101111111110101000011011… |
… | …010010101000010101100010 |
3 | 1000200010120101002211220112201 |
4 | 233332220123102220111202 |
5 | 210124210441441333442 |
6 | 2024441400021243414 |
7 | 62306062024361632 |
oct | 5776503322502542 |
9 | 1020116332756481 |
10 | 211012201121122 |
11 | 61264854502135 |
12 | 1b7bb6b326356a |
13 | 909849940511b |
14 | 3a1708b7ac6c2 |
15 | 195dda19957b7 |
hex | bfea1b4a8562 |
211012201121122 has 8 divisors (see below), whose sum is σ = 316519644779856. Its totient is φ = 105505652861172.
The previous prime is 211012201121063. The next prime is 211012201121123. The reversal of 211012201121122 is 221121102210112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×2110122011211222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 211012201121122.
It is not an unprimeable number, because it can be changed into a prime (211012201121123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 223260228 + ... + 224203375.
It is an arithmetic number, because the mean of its divisors is an integer number (39564955597482).
Almost surely, 2211012201121122 is an apocalyptic number.
211012201121122 is a deficient number, since it is larger than the sum of its proper divisors (105507443658734).
211012201121122 is a wasteful number, since it uses less digits than its factorization.
211012201121122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447699392.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 211012201121122 its reverse (221121102210112), we get a palindrome (432133303331234).
The spelling of 211012201121122 in words is "two hundred eleven trillion, twelve billion, two hundred one million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •