Base | Representation |
---|---|
bin | 10100100100100100… |
… | …11100111000001000 |
3 | 1001111200200202222010 |
4 | 22102102130320020 |
5 | 140104311320000 |
6 | 5023524255520 |
7 | 540454351005 |
oct | 122222347010 |
9 | 31450622863 |
10 | 11044245000 |
11 | 4758208808 |
12 | 21828415a0 |
13 | 1070149419 |
14 | 76ab0a8ac |
15 | 4498cdd50 |
hex | 29249ce08 |
11044245000 has 160 divisors (see below), whose sum is σ = 34756999200. Its totient is φ = 2923392000.
The previous prime is 11044244941. The next prime is 11044245053. The reversal of 11044245000 is 54244011.
It is a happy number.
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 39 ways as a sum of consecutive naturals, for example, 2082352 + ... + 2087648.
It is an arithmetic number, because the mean of its divisors is an integer number (217231245).
Almost surely, 211044245000 is an apocalyptic number.
11044245000 is a gapful number since it is divisible by the number (10) 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 11044245000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17378499600).
11044245000 is an abundant number, since it is smaller than the sum of its proper divisors (23712754200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11044245000 is a wasteful number, since it uses less digits than its factorization.
11044245000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5465 (or 5446 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 21.
Adding to 11044245000 its reverse (54244011), we get a palindrome (11098489011).
The spelling of 11044245000 in words is "eleven billion, forty-four million, two hundred forty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •