Base | Representation |
---|---|
bin | 10111011101110000110100… |
… | …100001011000100110000111 |
3 | 111112101212011012112101200002 |
4 | 113131300310201120212013 |
5 | 102011313311432330030 |
6 | 1003253331100511515 |
7 | 30510660003622652 |
oct | 2735606441304607 |
9 | 445355135471602 |
10 | 103200355355015 |
11 | 2a979030196586 |
12 | b6a8b0624b59b |
13 | 45779a07a4749 |
14 | 1b6acd108c899 |
15 | bde72877d245 |
hex | 5ddc34858987 |
103200355355015 has 4 divisors (see below), whose sum is σ = 123840426426024. Its totient is φ = 82560284284008.
The previous prime is 103200355355003. The next prime is 103200355355047. The reversal of 103200355355015 is 510553553002301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103200355355015 - 212 = 103200355350919 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103200355355015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10320035535497 + ... + 10320035535506.
It is an arithmetic number, because the mean of its divisors is an integer number (30960106606506).
Almost surely, 2103200355355015 is an apocalyptic number.
103200355355015 is a deficient number, since it is larger than the sum of its proper divisors (20640071071009).
103200355355015 is an equidigital number, since it uses as much as digits as its factorization.
103200355355015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20640071071008.
The product of its (nonzero) digits is 168750, while the sum is 38.
The spelling of 103200355355015 in words is "one hundred three trillion, two hundred billion, three hundred fifty-five million, three hundred fifty-five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •