Base | Representation |
---|---|
bin | 1001010001110011010010… |
… | …1011101101001000110111 |
3 | 1100010020200021120110001201 |
4 | 2110130310223231020313 |
5 | 2314120012341402221 |
6 | 33410250042433331 |
7 | 2102012655322051 |
oct | 224346453551067 |
9 | 40106607513051 |
10 | 10201431200311 |
11 | 3283447a6419a |
12 | 1189132802847 |
13 | 58ccb5b2b590 |
14 | 273a753248d1 |
15 | 12a568d71891 |
hex | 94734aed237 |
10201431200311 has 8 divisors (see below), whose sum is σ = 10986398784144. Its totient is φ = 9416498203200.
The previous prime is 10201431200299. The next prime is 10201431200321. The reversal of 10201431200311 is 11300213410201.
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 10201431200311 - 217 = 10201431069239 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 (10201431200321) 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, 8032465 + ... + 9215386.
It is an arithmetic number, because the mean of its divisors is an integer number (1373299848018).
Almost surely, 210201431200311 is an apocalyptic number.
10201431200311 is a deficient number, since it is larger than the sum of its proper divisors (784967583833).
10201431200311 is a wasteful number, since it uses less digits than its factorization.
10201431200311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17293361.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10201431200311 its reverse (11300213410201), we get a palindrome (21501644610512).
The spelling of 10201431200311 in words is "ten trillion, two hundred one billion, four hundred thirty-one million, two hundred thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •