Base | Representation |
---|---|
bin | 101111111110011111000111… |
… | …001011110001010011100000 |
3 | 1000200002121120010011111121020 |
4 | 233332133013023301103200 |
5 | 210124030001211231422 |
6 | 2024433023400525440 |
7 | 62305256135204046 |
oct | 5776370713612340 |
9 | 1020077503144536 |
10 | 211002200102112 |
11 | 61260592161571 |
12 | 1b7b9781a80880 |
13 | 909756444bbb3 |
14 | 3a167bd462396 |
15 | 195d9b898595c |
hex | bfe7c72f14e0 |
211002200102112 has 48 divisors (see below), whose sum is σ = 557082398290320. Its totient is φ = 69927511396352.
The previous prime is 211002200102059. The next prime is 211002200102123. The reversal of 211002200102112 is 211201002200112.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 211002200102091 and 211002200102100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6352409937 + ... + 6352443152.
It is an arithmetic number, because the mean of its divisors is an integer number (11605883297715).
Almost surely, 2211002200102112 is an apocalyptic number.
It is an amenable number.
211002200102112 is an abundant number, since it is smaller than the sum of its proper divisors (346080198188208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211002200102112 is a wasteful number, since it uses less digits than its factorization.
211002200102112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12704853275 (or 12704853267 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211002200102112 its reverse (211201002200112), we get a palindrome (422203202302224).
The spelling of 211002200102112 in words is "two hundred eleven trillion, two billion, two hundred million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •