Base | Representation |
---|---|
bin | 1010010011100011101101… |
… | …1100010011001011110010 |
3 | 1111010020121022020100222200 |
4 | 2210320323130103023302 |
5 | 2441122113434014302 |
6 | 40033240051444030 |
7 | 2246434512226632 |
oct | 244707334231362 |
9 | 44106538210880 |
10 | 11331121001202 |
11 | 3679557449012 |
12 | 13300695b6616 |
13 | 64269b93c772 |
14 | 2b260196a6c2 |
15 | 149b360c581c |
hex | a4e3b7132f2 |
11331121001202 has 48 divisors (see below), whose sum is σ = 25214989239960. Its totient is φ = 3674857165056.
The previous prime is 11331121001171. The next prime is 11331121001287. The reversal of 11331121001202 is 20210012113311.
11331121001202 is a `hidden beast` number, since 1 + 1 + 331 + 1 + 210 + 0 + 120 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 5948530759521 + 5382590241681 = 2438961^2 + 2320041^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 26272248 + ... + 26700060.
Almost surely, 211331121001202 is an apocalyptic number.
11331121001202 is an abundant number, since it is smaller than the sum of its proper divisors (13883868238758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331121001202 is a wasteful number, since it uses less digits than its factorization.
11331121001202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467627 (or 467624 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11331121001202 its reverse (20210012113311), we get a palindrome (31541133114513).
The spelling of 11331121001202 in words is "eleven trillion, three hundred thirty-one billion, one hundred twenty-one million, one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •