Base | Representation |
---|---|
bin | 101101011111111000101110… |
… | …001011101010101010101111 |
3 | 222020111200121002221020010112 |
4 | 231133320232023222222233 |
5 | 202211443030042142202 |
6 | 1545330104255130235 |
7 | 60101662225405445 |
oct | 5537705613525257 |
9 | 866450532836115 |
10 | 200103301130927 |
11 | 58839373895a27 |
12 | 1a53943a81397b |
13 | 878687798861c |
14 | 375b0a1276b95 |
15 | 182022d001b52 |
hex | b5fe2e2eaaaf |
200103301130927 has 2 divisors, whose sum is σ = 200103301130928. Its totient is φ = 200103301130926.
The previous prime is 200103301130921. The next prime is 200103301131017. The reversal of 200103301130927 is 729031103301002.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 200103301130927 - 236 = 200034581654191 is a prime.
It is a super-2 number, since 2×2001033011309272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200103301130893 and 200103301130902.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200103301130921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100051650565463 + 100051650565464.
It is an arithmetic number, because the mean of its divisors is an integer number (100051650565464).
Almost surely, 2200103301130927 is an apocalyptic number.
200103301130927 is a deficient number, since it is larger than the sum of its proper divisors (1).
200103301130927 is an equidigital number, since it uses as much as digits as its factorization.
200103301130927 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6804, while the sum is 32.
Adding to 200103301130927 its reverse (729031103301002), we get a palindrome (929134404431929).
The spelling of 200103301130927 in words is "two hundred trillion, one hundred three billion, three hundred one million, one hundred thirty thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •