Base | Representation |
---|---|
bin | 110001001000011100… |
… | …1001011101101110000 |
3 | 101002100011220122221012 |
4 | 1202100321023231300 |
5 | 3212041042440100 |
6 | 120245400050052 |
7 | 10423432155062 |
oct | 1422071135560 |
9 | 332304818835 |
10 | 105510124400 |
11 | 4082379511a |
12 | 18547163928 |
13 | 9c46259795 |
14 | 516cb91732 |
15 | 2b27d59135 |
hex | 1890e4bb70 |
105510124400 has 60 divisors (see below), whose sum is σ = 261665139264. Its totient is φ = 40842624000.
The previous prime is 105510124381. The next prime is 105510124411. The reversal of 105510124400 is 4421015501.
105510124400 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1055101244002 (a number of 23 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 4242041 + ... + 4266840.
Almost surely, 2105510124400 is an apocalyptic number.
105510124400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105510124400 is an abundant number, since it is smaller than the sum of its proper divisors (156155014864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105510124400 is a wasteful number, since it uses less digits than its factorization.
105510124400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8508930 (or 8508919 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 23.
Adding to 105510124400 its reverse (4421015501), we get a palindrome (109931139901).
The spelling of 105510124400 in words is "one hundred five billion, five hundred ten million, one hundred twenty-four thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •