Base | Representation |
---|---|
bin | 10010111111111110… |
… | …10000001001010011 |
3 | 222022212202112110110 |
4 | 21133333100021103 |
5 | 131342242220230 |
6 | 4404100532403 |
7 | 510526361400 |
oct | 113777201123 |
9 | 28285675413 |
10 | 10200351315 |
11 | 4364917a10 |
12 | 1b880b1103 |
13 | c6736864b |
14 | 6ca9d72a7 |
15 | 3ea7864b0 |
hex | 25ffd0253 |
10200351315 has 48 divisors (see below), whose sum is σ = 20711082240. Its totient is φ = 4239103680.
The previous prime is 10200351307. The next prime is 10200351341. The reversal of 10200351315 is 51315300201.
It is not a de Polignac number, because 10200351315 - 23 = 10200351307 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 10200351291 and 10200351300.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 622735 + ... + 638904.
It is an arithmetic number, because the mean of its divisors is an integer number (431480880).
Almost surely, 210200351315 is an apocalyptic number.
10200351315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10200351315 is an abundant number, since it is smaller than the sum of its proper divisors (10510730925).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10200351315 is a wasteful number, since it uses less digits than its factorization.
10200351315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1261672 (or 1261665 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 21.
Adding to 10200351315 its reverse (51315300201), we get a palindrome (61515651516).
The spelling of 10200351315 in words is "ten billion, two hundred million, three hundred fifty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •