Base | Representation |
---|---|
bin | 1010000000111011111101… |
… | …0101010011010011100010 |
3 | 1102222122212020112020221120 |
4 | 2200032333111103103202 |
5 | 2420401430032241002 |
6 | 35230251450433110 |
7 | 2214351036001521 |
oct | 240167725232342 |
9 | 42878766466846 |
10 | 11011211212002 |
11 | 3565912738481 |
12 | 129a068432796 |
13 | 61b478030101 |
14 | 2a0d345064b8 |
15 | 141660a69cbc |
hex | a03bf5534e2 |
11011211212002 has 16 divisors (see below), whose sum is σ = 22559554678752. Its totient is φ = 3580881694880.
The previous prime is 11011211211991. The next prime is 11011211212003. The reversal of 11011211212002 is 20021211211011.
It is a happy number.
11011211212002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (11011211212003) 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, 22380510348 + ... + 22380510839.
It is an arithmetic number, because the mean of its divisors is an integer number (1409972167422).
Almost surely, 211011211212002 is an apocalyptic number.
11011211212002 is an abundant number, since it is smaller than the sum of its proper divisors (11548343466750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011211212002 is a wasteful number, since it uses less digits than its factorization.
11011211212002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44761021233.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11011211212002 its reverse (20021211211011), we get a palindrome (31032422423013).
Subtracting 11011211212002 from its reverse (20021211211011), we obtain a palindrome (9009999999009).
The spelling of 11011211212002 in words is "eleven trillion, eleven billion, two hundred eleven million, two hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •