Base | Representation |
---|---|
bin | 1001010001110001110001… |
… | …0000000100100011110111 |
3 | 1100010012121201021111200222 |
4 | 2110130130100010203313 |
5 | 2314113142423144111 |
6 | 33410141241124555 |
7 | 2101666550256206 |
oct | 224343420044367 |
9 | 40105551244628 |
10 | 10201021303031 |
11 | 3283257649309 |
12 | 118903948975b |
13 | 58cc4bc33100 |
14 | 273a36b0523d |
15 | 12a542da57db |
hex | 9471c4048f7 |
10201021303031 has 12 divisors (see below), whose sum is σ = 11153319800688. Its totient is φ = 9324906686784.
The previous prime is 10201021303019. The next prime is 10201021303069. The reversal of 10201021303031 is 13030312010201.
It is a de Polignac number, because none of the positive numbers 2k-10201021303031 is a prime.
It is a super-2 number, since 2×102010213030312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201021303831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 292997510 + ... + 293032323.
It is an arithmetic number, because the mean of its divisors is an integer number (929443316724).
Almost surely, 210201021303031 is an apocalyptic number.
10201021303031 is a deficient number, since it is larger than the sum of its proper divisors (952298497657).
10201021303031 is a wasteful number, since it uses less digits than its factorization.
10201021303031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586029962 (or 586029949 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10201021303031 its reverse (13030312010201), we get a palindrome (23231333313232).
The spelling of 10201021303031 in words is "ten trillion, two hundred one billion, twenty-one million, three hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •