Base | Representation |
---|---|
bin | 110001001000100110… |
… | …1100000101100010000 |
3 | 101002100112221101200011 |
4 | 1202101031200230100 |
5 | 3212043424000300 |
6 | 120250110204304 |
7 | 10423525360663 |
oct | 1422115405420 |
9 | 332315841604 |
10 | 105515453200 |
11 | 408267a4793 |
12 | 18548ab3694 |
13 | 9c473a4111 |
14 | 516d77b6da |
15 | 2b2855ceba |
hex | 1891360b10 |
105515453200 has 60 divisors (see below), whose sum is σ = 264522676608. Its totient is φ = 40371126400.
The previous prime is 105515453107. The next prime is 105515453201. The reversal of 105515453200 is 2354515501.
It is a super-3 number, since 3×1055154532003 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (105515453201) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 5725336 + ... + 5743735.
Almost surely, 2105515453200 is an apocalyptic number.
105515453200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105515453200 is an abundant number, since it is smaller than the sum of its proper divisors (159007223408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105515453200 is a wasteful number, since it uses less digits than its factorization.
105515453200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11469112 (or 11469101 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 31.
Adding to 105515453200 its reverse (2354515501), we get a palindrome (107869968701).
The spelling of 105515453200 in words is "one hundred five billion, five hundred fifteen million, four hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.248 sec. • engine limits •