Base | Representation |
---|---|
bin | 10011000000000101… |
… | …11010101111011101 |
3 | 222022221120100120120 |
4 | 21200002322233131 |
5 | 131343013442341 |
6 | 4404133305153 |
7 | 510540503022 |
oct | 114002725735 |
9 | 28287510516 |
10 | 10201312221 |
11 | 4365413951 |
12 | 1b884951b9 |
13 | c67613b29 |
14 | 6caba7549 |
15 | 3ea8c6066 |
hex | 2600babdd |
10201312221 has 16 divisors (see below), whose sum is σ = 13776829248. Its totient is φ = 6713884800.
The previous prime is 10201312201. The next prime is 10201312237. The reversal of 10201312221 is 12221310201.
10201312221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10201312221 - 214 = 10201295837 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10201312221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201312201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5826 + ... + 142956.
It is an arithmetic number, because the mean of its divisors is an integer number (861051828).
Almost surely, 210201312221 is an apocalyptic number.
It is an amenable number.
10201312221 is a deficient number, since it is larger than the sum of its proper divisors (3575517027).
10201312221 is a wasteful number, since it uses less digits than its factorization.
10201312221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137452.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10201312221 its reverse (12221310201), we get a palindrome (22422622422).
The spelling of 10201312221 in words is "ten billion, two hundred one million, three hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •