Base | Representation |
---|---|
bin | 10100100011000000… |
… | …10110011010010000 |
3 | 1001110202222111221020 |
4 | 22101200112122100 |
5 | 140042431030222 |
6 | 5022334555440 |
7 | 540234620244 |
oct | 122140263220 |
9 | 31422874836 |
10 | 11031111312 |
11 | 4750858221 |
12 | 217a368b80 |
13 | 106a4cb400 |
14 | 76908c424 |
15 | 44868765c |
hex | 291816690 |
11031111312 has 120 divisors (see below), whose sum is σ = 31515375744. Its totient is φ = 3321856512.
The previous prime is 11031111209. The next prime is 11031111337. The reversal of 11031111312 is 21311113011.
It is a super-2 number, since 2×110311113122 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11031111291 and 11031111300.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 366798 + ... + 395730.
Almost surely, 211031111312 is an apocalyptic number.
11031111312 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11031111312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15757687872).
11031111312 is an abundant number, since it is smaller than the sum of its proper divisors (20484264432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11031111312 is a wasteful number, since it uses less digits than its factorization.
11031111312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29017 (or 28998 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 11031111312 its reverse (21311113011), we get a palindrome (32342224323).
The spelling of 11031111312 in words is "eleven billion, thirty-one million, one hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •