Base | Representation |
---|---|
bin | 10100101101111101… |
… | …11000101010110000 |
3 | 1001201011220001022020 |
4 | 22112332320222300 |
5 | 140234442031112 |
6 | 5035420311440 |
7 | 542431646232 |
oct | 122676705260 |
9 | 31634801266 |
10 | 11123002032 |
11 | 479871006a |
12 | 21a50a2580 |
13 | 1083562b0c |
14 | 77736c252 |
15 | 45178948c |
hex | 296fb8ab0 |
11123002032 has 80 divisors (see below), whose sum is σ = 30015697920. Its totient is φ = 3542685696.
The previous prime is 11123002019. The next prime is 11123002057. The reversal of 11123002032 is 23020032111.
It is a super-2 number, since 2×111230020322 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1142208 + ... + 1151904.
It is an arithmetic number, because the mean of its divisors is an integer number (375196224).
Almost surely, 211123002032 is an apocalyptic number.
11123002032 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 11123002032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15007848960).
11123002032 is an abundant number, since it is smaller than the sum of its proper divisors (18892695888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11123002032 is a wasteful number, since it uses less digits than its factorization.
11123002032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10770 (or 10764 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 11123002032 its reverse (23020032111), we get a palindrome (34143034143).
The spelling of 11123002032 in words is "eleven billion, one hundred twenty-three million, two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •