Base | Representation |
---|---|
bin | 10010111111111110… |
… | …11110110010100101 |
3 | 222022212212120202011 |
4 | 21133333132302211 |
5 | 131342301130201 |
6 | 4404102114221 |
7 | 510530031313 |
oct | 113777366245 |
9 | 28285776664 |
10 | 10200411301 |
11 | 4364958a93 |
12 | 1b8811b971 |
13 | c67389a42 |
14 | 6caa110b3 |
15 | 3ea799151 |
hex | 25ffdeca5 |
10200411301 has 4 divisors (see below), whose sum is σ = 10203147532. Its totient is φ = 10197675072.
The previous prime is 10200411259. The next prime is 10200411379. The reversal of 10200411301 is 10311400201.
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 2054446276 + 8145965025 = 45326^2 + 90255^2 .
It is a cyclic number.
It is not a de Polignac number, because 10200411301 - 215 = 10200378533 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 (10200411601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1362516 + ... + 1369981.
It is an arithmetic number, because the mean of its divisors is an integer number (2550786883).
Almost surely, 210200411301 is an apocalyptic number.
It is an amenable number.
10200411301 is a deficient number, since it is larger than the sum of its proper divisors (2736231).
10200411301 is an equidigital number, since it uses as much as digits as its factorization.
10200411301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2736230.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10200411301 its reverse (10311400201), we get a palindrome (20511811502).
The spelling of 10200411301 in words is "ten billion, two hundred million, four hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •