Base | Representation |
---|---|
bin | 1010000000111111110000… |
… | …1011010011111000011110 |
3 | 1102222202111101022211002100 |
4 | 2200033330023103320132 |
5 | 2420411022343044402 |
6 | 35230541033505530 |
7 | 2214415242405051 |
oct | 240177413237036 |
9 | 42882441284070 |
10 | 11012232003102 |
11 | 3566296971990 |
12 | 129a2b22722a6 |
13 | 61b5ab669805 |
14 | 2a0dcdd06a98 |
15 | 1416c04a671c |
hex | a03fc2d3e1e |
11012232003102 has 96 divisors (see below), whose sum is σ = 28343643120000. Its totient is φ = 3052392275520.
The previous prime is 11012232003053. The next prime is 11012232003133. The reversal of 11012232003102 is 20130023221011.
11012232003102 is a `hidden beast` number, since 1 + 10 + 1 + 22 + 320 + 0 + 310 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 50360352 + ... + 50578547.
It is an arithmetic number, because the mean of its divisors is an integer number (295246282500).
Almost surely, 211012232003102 is an apocalyptic number.
11012232003102 is an abundant number, since it is smaller than the sum of its proper divisors (17331411116898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11012232003102 is a wasteful number, since it uses less digits than its factorization.
11012232003102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100938966 (or 100938963 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11012232003102 its reverse (20130023221011), we get a palindrome (31142255224113).
The spelling of 11012232003102 in words is "eleven trillion, twelve billion, two hundred thirty-two million, three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •