Base | Representation |
---|---|
bin | 1011101010001110110… |
… | …1011110100011000001 |
3 | 201011001022012121010122 |
4 | 2322203231132203001 |
5 | 11240221131302200 |
6 | 232005023510025 |
7 | 20320665166613 |
oct | 2724355364301 |
9 | 634038177118 |
10 | 200315103425 |
11 | 77a53721058 |
12 | 329a5158315 |
13 | 15b746a76c8 |
14 | 99a3ca6db3 |
15 | 5325e68385 |
hex | 2ea3b5e8c1 |
200315103425 has 12 divisors (see below), whose sum is σ = 249691209216. Its totient is φ = 159413062800.
The previous prime is 200315103403. The next prime is 200315103451. The reversal of 200315103425 is 524301513002.
It is a happy number.
It is not a de Polignac number, because 200315103425 - 230 = 199241361601 is a prime.
It is a super-2 number, since 2×2003151034252 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200315103394 and 200315103403.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 20970629 + ... + 20980178.
It is an arithmetic number, because the mean of its divisors is an integer number (20807600768).
Almost surely, 2200315103425 is an apocalyptic number.
200315103425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
200315103425 is a deficient number, since it is larger than the sum of its proper divisors (49376105791).
200315103425 is a wasteful number, since it uses less digits than its factorization.
200315103425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41951008 (or 41951003 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 200315103425 its reverse (524301513002), we get a palindrome (724616616427).
The spelling of 200315103425 in words is "two hundred billion, three hundred fifteen million, one hundred three thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •