Base | Representation |
---|---|
bin | 10000011111011110100… |
… | …110011100111111001010 |
3 | 11000100021101121222001100 |
4 | 100133132212130333022 |
5 | 122032010110133002 |
6 | 2224345204202230 |
7 | 144610334506566 |
oct | 20373646347712 |
9 | 4010241558040 |
10 | 1133311021002 |
11 | 3a76a8587116 |
12 | 163787699376 |
13 | 82b42110ba4 |
14 | 3cbd155a6a6 |
15 | 1e73010811c |
hex | 107de99cfca |
1133311021002 has 12 divisors (see below), whose sum is σ = 2455507212210. Its totient is φ = 377770340328.
The previous prime is 1133311020967. The next prime is 1133311021021. The reversal of 1133311021002 is 2001201133311.
1133311021002 is a `hidden beast` number, since 11 + 333 + 110 + 210 + 0 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 738724779081 + 394586241921 = 859491^2 + 628161^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 62961723389 = 1133311021002 / (1 + 1 + 3 + 3 + 3 + 1 + 1 + 0 + 2 + 1 + 0 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 31480861677 + ... + 31480861712.
Almost surely, 21133311021002 is an apocalyptic number.
1133311021002 is an abundant number, since it is smaller than the sum of its proper divisors (1322196191208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1133311021002 is a wasteful number, since it uses less digits than its factorization.
1133311021002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62961723397 (or 62961723394 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1133311021002 its reverse (2001201133311), we get a palindrome (3134512154313).
The spelling of 1133311021002 in words is "one trillion, one hundred thirty-three billion, three hundred eleven million, twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •