Base | Representation |
---|---|
bin | 110000101010111110… |
… | …0100001100001010000 |
3 | 100222210020222021102022 |
4 | 1201111330201201100 |
5 | 3203024403110100 |
6 | 120003310511012 |
7 | 10360063032341 |
oct | 1412574414120 |
9 | 328706867368 |
10 | 104521144400 |
11 | 40366508882 |
12 | 1830bb05468 |
13 | 9b193aa50a |
14 | 50b76b20c8 |
15 | 2abb102e85 |
hex | 1855f21850 |
104521144400 has 120 divisors (see below), whose sum is σ = 252683095104. Its totient is φ = 41547750400.
The previous prime is 104521144393. The next prime is 104521144423. The reversal of 104521144400 is 4441125401.
It is a self number, because there is not a number n which added to its sum of digits gives 104521144400.
It is a congruent number.
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, 54808247 + ... + 54810153.
Almost surely, 2104521144400 is an apocalyptic number.
104521144400 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 104521144400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126341547552).
104521144400 is an abundant number, since it is smaller than the sum of its proper divisors (148161950704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104521144400 is a wasteful number, since it uses less digits than its factorization.
104521144400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2709 (or 2698 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 26.
Adding to 104521144400 its reverse (4441125401), we get a palindrome (108962269801).
The spelling of 104521144400 in words is "one hundred four billion, five hundred twenty-one million, one hundred forty-four thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •