Base | Representation |
---|---|
bin | 110011101101000100… |
… | …1001011010111000000 |
3 | 101121121011002200221201 |
4 | 1213122021023113000 |
5 | 3304344202140222 |
6 | 123001444230544 |
7 | 11010345415564 |
oct | 1473211132700 |
9 | 347534080851 |
10 | 111034021312 |
11 | 430a88a0685 |
12 | 1962909b454 |
13 | a6167b9536 |
14 | 55346696a4 |
15 | 2d4cc99427 |
hex | 19da24b5c0 |
111034021312 has 112 divisors (see below), whose sum is σ = 231714812160. Its totient is φ = 52688959488.
The previous prime is 111034021291. The next prime is 111034021327. The reversal of 111034021312 is 213120430111.
It is a self number, because there is not a number n which added to its sum of digits gives 111034021312.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179376139 + ... + 179376757.
Almost surely, 2111034021312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111034021312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115857406080).
111034021312 is an abundant number, since it is smaller than the sum of its proper divisors (120680790848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111034021312 is a wasteful number, since it uses less digits than its factorization.
111034021312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1410 (or 1400 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 111034021312 its reverse (213120430111), we get a palindrome (324154451423).
The spelling of 111034021312 in words is "one hundred eleven billion, thirty-four million, twenty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •