Base | Representation |
---|---|
bin | 1010000000111111010110… |
… | …1000100100010100100111 |
3 | 1102222202012201202212120210 |
4 | 2200033311220210110213 |
5 | 2420410311242411403 |
6 | 35230522113030503 |
7 | 2214412440356016 |
oct | 240176550442447 |
9 | 42882181685523 |
10 | 11012122232103 |
11 | 356623aa07353 |
12 | 129a281555433 |
13 | 61b5919b4765 |
14 | 2a0dbd4d0a7d |
15 | 1416b5a21b03 |
hex | a03f5a24527 |
11012122232103 has 8 divisors (see below), whose sum is σ = 15455610150400. Its totient is φ = 6955024567608.
The previous prime is 11012122232077. The next prime is 11012122232107. The reversal of 11012122232103 is 30123222121011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11012122232103 - 212 = 11012122228007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11012122232103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012122232107) 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, 96597563383 + ... + 96597563496.
It is an arithmetic number, because the mean of its divisors is an integer number (1931951268800).
Almost surely, 211012122232103 is an apocalyptic number.
11012122232103 is a deficient number, since it is larger than the sum of its proper divisors (4443487918297).
11012122232103 is a wasteful number, since it uses less digits than its factorization.
11012122232103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 193195126901.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11012122232103 its reverse (30123222121011), we get a palindrome (41135344353114).
The spelling of 11012122232103 in words is "eleven trillion, twelve billion, one hundred twenty-two million, two hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •