Base | Representation |
---|---|
bin | 1010000001000011010111… |
… | …1000010100011011011100 |
3 | 1102222211222211222101200000 |
4 | 2200100311320110123130 |
5 | 2420420013211300012 |
6 | 35231221055334300 |
7 | 2214451236205113 |
oct | 240206570243334 |
9 | 42884884871600 |
10 | 11013200103132 |
11 | 3566743387857 |
12 | 129a522521390 |
13 | 61b7040b7c76 |
14 | 2a108270cc7a |
15 | 14172a485ddc |
hex | a0435e146dc |
11013200103132 has 72 divisors (see below), whose sum is σ = 28886657073456. Its totient is φ = 3668947809408.
The previous prime is 11013200103083. The next prime is 11013200103149. The reversal of 11013200103132 is 23130100231011.
11013200103132 is a `hidden beast` number, since 110 + 1 + 320 + 0 + 103 + 132 = 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 (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1584553 + ... + 4953504.
Almost surely, 211013200103132 is an apocalyptic number.
11013200103132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11013200103132 is an abundant number, since it is smaller than the sum of its proper divisors (17873456970324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11013200103132 is a wasteful number, since it uses less digits than its factorization.
11013200103132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6539809 (or 6539795 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 11013200103132 its reverse (23130100231011), we get a palindrome (34143300334143).
The spelling of 11013200103132 in words is "eleven trillion, thirteen billion, two hundred million, one hundred three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •