Base | Representation |
---|---|
bin | 1001010001110010111000… |
… | …1100010100101001000101 |
3 | 1100010020101200200020221010 |
4 | 2110130232030110221011 |
5 | 2314114302002411323 |
6 | 33410231152512433 |
7 | 2102010163632156 |
oct | 224345614245105 |
9 | 40106350606833 |
10 | 10201322310213 |
11 | 32833a1550481 |
12 | 118910224b719 |
13 | 58cc993c4478 |
14 | 273a64a9b92d |
15 | 12a55e512c93 |
hex | 9472e314a45 |
10201322310213 has 16 divisors (see below), whose sum is σ = 13619953391616. Its totient is φ = 6791789199600.
The previous prime is 10201322310211. The next prime is 10201322310229. The reversal of 10201322310213 is 31201322310201.
It is not a de Polignac number, because 10201322310213 - 21 = 10201322310211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10201322310213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201322310211) 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 15 ways as a sum of consecutive naturals, for example, 14281806 + ... + 14979072.
It is an arithmetic number, because the mean of its divisors is an integer number (851247086976).
Almost surely, 210201322310213 is an apocalyptic number.
It is an amenable number.
10201322310213 is a deficient number, since it is larger than the sum of its proper divisors (3418631081403).
10201322310213 is an equidigital number, since it uses as much as digits as its factorization.
10201322310213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703784.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10201322310213 its reverse (31201322310201), we get a palindrome (41402644620414).
The spelling of 10201322310213 in words is "ten trillion, two hundred one billion, three hundred twenty-two million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •