Base | Representation |
---|---|
bin | 1001010001110110100100… |
… | …0101010100101110101111 |
3 | 1100010022221112210221002010 |
4 | 2110131221011110232233 |
5 | 2314123312421100221 |
6 | 33410513205332303 |
7 | 2102043521652150 |
oct | 224355105245657 |
9 | 40108845727063 |
10 | 10202310331311 |
11 | 328385923233a |
12 | 1189339107093 |
13 | 5900c5cc9137 |
14 | 273b19dab927 |
15 | 12a5bb129c76 |
hex | 94769154baf |
10202310331311 has 32 divisors (see below), whose sum is σ = 16745607364608. Its totient is φ = 5396533607520.
The previous prime is 10202310331253. The next prime is 10202310331327. The reversal of 10202310331311 is 11313301320201.
It is a happy number.
It is not a de Polignac number, because 10202310331311 - 230 = 10201236589487 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202310335311) 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 31 ways as a sum of consecutive naturals, for example, 340675281 + ... + 340705226.
It is an arithmetic number, because the mean of its divisors is an integer number (523300230144).
Almost surely, 210202310331311 is an apocalyptic number.
10202310331311 is a deficient number, since it is larger than the sum of its proper divisors (6543297033297).
10202310331311 is a wasteful number, since it uses less digits than its factorization.
10202310331311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681380571.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10202310331311 its reverse (11313301320201), we get a palindrome (21515611651512).
The spelling of 10202310331311 in words is "ten trillion, two hundred two billion, three hundred ten million, three hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •