Base | Representation |
---|---|
bin | 110000001110000100… |
… | …0100010011001100000 |
3 | 100220021122212202200121 |
4 | 1200130020202121200 |
5 | 3144033102341300 |
6 | 115323141530024 |
7 | 10324044543406 |
oct | 1403410423140 |
9 | 326248782617 |
10 | 103551215200 |
11 | 3aa08a636a4 |
12 | 1809b113914 |
13 | 99c346b604 |
14 | 5024951476 |
15 | 2a60db181a |
hex | 181c222660 |
103551215200 has 72 divisors (see below), whose sum is σ = 255634966440. Its totient is φ = 40955059200.
The previous prime is 103551215179. The next prime is 103551215203. The reversal of 103551215200 is 2512155301.
It is a super-3 number, since 3×1035512152003 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103551215203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 655986 + ... + 798385.
It is an arithmetic number, because the mean of its divisors is an integer number (3550485645).
Almost surely, 2103551215200 is an apocalyptic number.
103551215200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103551215200 is an abundant number, since it is smaller than the sum of its proper divisors (152083751240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103551215200 is a wasteful number, since it uses less digits than its factorization.
103551215200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1454480 (or 1454467 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The spelling of 103551215200 in words is "one hundred three billion, five hundred fifty-one million, two hundred fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •