Base | Representation |
---|---|
bin | 100000001011010010111… |
… | …001110010110111010100 |
3 | 21211101100221202021112000 |
4 | 200023102321302313110 |
5 | 242211414244243202 |
6 | 4411442231355300 |
7 | 315515253055215 |
oct | 40132271626724 |
9 | 7741327667460 |
10 | 2211151556052 |
11 | 78282045510a |
12 | 2b8652222b30 |
13 | 13068400310a |
14 | 7903da1340c |
15 | 3c7b547b91c |
hex | 202d2e72dd4 |
2211151556052 has 24 divisors (see below), whose sum is σ = 5732615145600. Its totient is φ = 737050518648.
The previous prime is 2211151556051. The next prime is 2211151556059. The reversal of 2211151556052 is 2506551511122.
2211151556052 is a `hidden beast` number, since 2 + 2 + 1 + 1 + 1 + 51 + 556 + 0 + 52 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 2211151555998 and 2211151556016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2211151556051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10236812652 + ... + 10236812867.
It is an arithmetic number, because the mean of its divisors is an integer number (238858964400).
Almost surely, 22211151556052 is an apocalyptic number.
It is an amenable number.
2211151556052 is an abundant number, since it is smaller than the sum of its proper divisors (3521463589548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2211151556052 is a wasteful number, since it uses less digits than its factorization.
2211151556052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20473625532 (or 20473625524 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 36.
The spelling of 2211151556052 in words is "two trillion, two hundred eleven billion, one hundred fifty-one million, five hundred fifty-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •