Base | Representation |
---|---|
bin | 10010111111111101… |
… | …11000001001001001 |
3 | 222022212120112121012 |
4 | 21133332320021021 |
5 | 131342231044001 |
6 | 4404054453305 |
7 | 510525501641 |
oct | 113776701111 |
9 | 28285515535 |
10 | 10200253001 |
11 | 4364860064 |
12 | 1b88064235 |
13 | c67332983 |
14 | 6ca9ad521 |
15 | 3ea7672bb |
hex | 25ffb8249 |
10200253001 has 4 divisors (see below), whose sum is σ = 10203340752. Its totient is φ = 10197165252.
The previous prime is 10200252991. The next prime is 10200253013. The reversal of 10200253001 is 10035200201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10200253001 is a prime.
It is a super-2 number, since 2×102002530012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10200253081) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1538915 + ... + 1545528.
It is an arithmetic number, because the mean of its divisors is an integer number (2550835188).
Almost surely, 210200253001 is an apocalyptic number.
It is an amenable number.
10200253001 is a deficient number, since it is larger than the sum of its proper divisors (3087751).
10200253001 is an equidigital number, since it uses as much as digits as its factorization.
10200253001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3087750.
The product of its (nonzero) digits is 60, while the sum is 14.
Adding to 10200253001 its reverse (10035200201), we get a palindrome (20235453202).
The spelling of 10200253001 in words is "ten billion, two hundred million, two hundred fifty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •