Base | Representation |
---|---|
bin | 1010000001100000011011… |
… | …0111001100000011000110 |
3 | 1110000121010112010210100212 |
4 | 2200120012313030003012 |
5 | 2421032002302241402 |
6 | 35234551132235422 |
7 | 2215145453430050 |
oct | 240300667140306 |
9 | 43017115123325 |
10 | 11021001212102 |
11 | 3569a8695a452 |
12 | 129bb3b00bb72 |
13 | 61c37837178b |
14 | 2a15c28028d0 |
15 | 141a35295952 |
hex | a0606dcc0c6 |
11021001212102 has 8 divisors (see below), whose sum is σ = 18893144935056. Its totient is φ = 4723286233752.
The previous prime is 11021001212071. The next prime is 11021001212119. The reversal of 11021001212102 is 20121210012011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 787214372293 = 11021001212102 / (1 + 1 + 0 + 2 + 1 + 0 + 0 + 1 + 2 + 1 + 2 + 1 + 0 + 2).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 393607186133 + ... + 393607186160.
It is an arithmetic number, because the mean of its divisors is an integer number (2361643116882).
Almost surely, 211021001212102 is an apocalyptic number.
11021001212102 is a deficient number, since it is larger than the sum of its proper divisors (7872143722954).
11021001212102 is an equidigital number, since it uses as much as digits as its factorization.
11021001212102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787214372302.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11021001212102 its reverse (20121210012011), we get a palindrome (31142211224113).
The spelling of 11021001212102 in words is "eleven trillion, twenty-one billion, one million, two hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •