Base | Representation |
---|---|
bin | 110000000110110010… |
… | …1111110101011111000 |
3 | 100212122122212022122101 |
4 | 1200031211332223320 |
5 | 3143033130300000 |
6 | 115243025233144 |
7 | 10315023230446 |
oct | 1401545765370 |
9 | 325578768571 |
10 | 103307275000 |
11 | 3a8a3299826 |
12 | 180314927b4 |
13 | 9984a6b1b7 |
14 | 50003b1b96 |
15 | 2a49777e6a |
hex | 180d97eaf8 |
103307275000 has 96 divisors (see below), whose sum is σ = 254854782000. Its totient is φ = 39147840000.
The previous prime is 103307274949. The next prime is 103307275031. The reversal of 103307275000 is 572703301.
It is a self number, because there is not a number n which added to its sum of digits gives 103307275000.
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, 366256 + ... + 583744.
Almost surely, 2103307275000 is an apocalyptic number.
103307275000 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 103307275000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127427391000).
103307275000 is an abundant number, since it is smaller than the sum of its proper divisors (151547507000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103307275000 is an equidigital number, since it uses as much as digits as its factorization.
103307275000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 217539 (or 217515 counting only the distinct ones).
The product of its (nonzero) digits is 4410, while the sum is 28.
Adding to 103307275000 its reverse (572703301), we get a palindrome (103879978301).
The spelling of 103307275000 in words is "one hundred three billion, three hundred seven million, two hundred seventy-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •