Base | Representation |
---|---|
bin | 10100100010001100… |
… | …00111011000110000 |
3 | 1001110022001010002011 |
4 | 22101012013120300 |
5 | 140034200442112 |
6 | 5021531332304 |
7 | 540122305000 |
oct | 122106073060 |
9 | 31408033064 |
10 | 11024234032 |
11 | 4747990219 |
12 | 2177bb1094 |
13 | 1068c61006 |
14 | 7681bc000 |
15 | 447c79aa7 |
hex | 291187630 |
11024234032 has 80 divisors (see below), whose sum is σ = 25156872000. Its totient is φ = 4677657600.
The previous prime is 11024234003. The next prime is 11024234047. The reversal of 11024234032 is 23043242011.
It is a junction number, because it is equal to n+sod(n) for n = 11024233994 and 11024234012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 544344 + ... + 564232.
It is an arithmetic number, because the mean of its divisors is an integer number (314460900).
Almost surely, 211024234032 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 11024234032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12578436000).
11024234032 is an abundant number, since it is smaller than the sum of its proper divisors (14132637968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11024234032 is a wasteful number, since it uses less digits than its factorization.
11024234032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20019 (or 19999 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 11024234032 its reverse (23043242011), we get a palindrome (34067476043).
The spelling of 11024234032 in words is "eleven billion, twenty-four million, two hundred thirty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •