Base | Representation |
---|---|
bin | 10011000001001001… |
… | …10100101010000101 |
3 | 222100120021220120212 |
4 | 21200210310222011 |
5 | 131402302401242 |
6 | 4405052005205 |
7 | 511006161341 |
oct | 114044645205 |
9 | 28316256525 |
10 | 10210200197 |
11 | 436a43458a |
12 | 1b8b460805 |
13 | c694064a2 |
14 | 6cc03c621 |
15 | 3eb57e782 |
hex | 260934a85 |
10210200197 has 4 divisors (see below), whose sum is σ = 10234452876. Its totient is φ = 10185947520.
The previous prime is 10210200163. The next prime is 10210200199. The reversal of 10210200197 is 79100201201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4967571361 + 5242628836 = 70481^2 + 72406^2 .
It is a cyclic number.
It is not a de Polignac number, because 10210200197 - 28 = 10210199941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10210200199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12125708 + ... + 12126549.
It is an arithmetic number, because the mean of its divisors is an integer number (2558613219).
Almost surely, 210210200197 is an apocalyptic number.
It is an amenable number.
10210200197 is a deficient number, since it is larger than the sum of its proper divisors (24252679).
10210200197 is an equidigital number, since it uses as much as digits as its factorization.
10210200197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24252678.
The product of its (nonzero) digits is 252, while the sum is 23.
Adding to 10210200197 its reverse (79100201201), we get a palindrome (89310401398).
The spelling of 10210200197 in words is "ten billion, two hundred ten million, two hundred thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •