Base | Representation |
---|---|
bin | 110000001110000111… |
… | …1110010010010111000 |
3 | 100220021210110022011102 |
4 | 1200130033302102320 |
5 | 3144034044142240 |
6 | 115323250350532 |
7 | 10324066646204 |
oct | 1403417622270 |
9 | 326253408142 |
10 | 103553115320 |
11 | 3aa0a041246 |
12 | 1809b88b448 |
13 | 99c3985445 |
14 | 5024cc7b04 |
15 | 2a61139815 |
hex | 181c3f24b8 |
103553115320 has 32 divisors (see below), whose sum is σ = 241028805600. Its totient is φ = 39992926848.
The previous prime is 103553115317. The next prime is 103553115361. The reversal of 103553115320 is 23511355301.
It is a happy number.
It is a super-3 number, since 3×1035531153203 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
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 7 ways as a sum of consecutive naturals, for example, 44633804 + ... + 44636123.
It is an arithmetic number, because the mean of its divisors is an integer number (7532150175).
Almost surely, 2103553115320 is an apocalyptic number.
103553115320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103553115320 is an abundant number, since it is smaller than the sum of its proper divisors (137475690280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103553115320 is a wasteful number, since it uses less digits than its factorization.
103553115320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89269967 (or 89269963 counting only the distinct ones).
The product of its (nonzero) digits is 6750, while the sum is 29.
The spelling of 103553115320 in words is "one hundred three billion, five hundred fifty-three million, one hundred fifteen thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •