Base | Representation |
---|---|
bin | 1001010001111110000001… |
… | …0001101001010111111101 |
3 | 1100010112002220122011211102 |
4 | 2110133200101221113331 |
5 | 2314141411333102201 |
6 | 33411443442302445 |
7 | 2102144213203523 |
oct | 224374021512775 |
9 | 40115086564742 |
10 | 10204310050301 |
11 | 3284694aa7864 |
12 | 11897b6957a25 |
13 | 5903543a5603 |
14 | 273c697d2313 |
15 | 12a68698426b |
hex | 947e04695fd |
10204310050301 has 8 divisors (see below), whose sum is σ = 10207393568064. Its totient is φ = 10201227010240.
The previous prime is 10204310050283. The next prime is 10204310050367. The reversal of 10204310050301 is 10305001340201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10204310050301 - 230 = 10203236308477 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 (10204310050381) 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 7 ways as a sum of consecutive naturals, for example, 45165146 + ... + 45390516.
It is an arithmetic number, because the mean of its divisors is an integer number (1275924196008).
Almost surely, 210204310050301 is an apocalyptic number.
It is an amenable number.
10204310050301 is a deficient number, since it is larger than the sum of its proper divisors (3083517763).
10204310050301 is an equidigital number, since it uses as much as digits as its factorization.
10204310050301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238851.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 10204310050301 its reverse (10305001340201), we get a palindrome (20509311390502).
The spelling of 10204310050301 in words is "ten trillion, two hundred four billion, three hundred ten million, fifty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •