Base | Representation |
---|---|
bin | 101111001000011000… |
… | …1110011010100111001 |
3 | 100200020201112102020022 |
4 | 1132100301303110321 |
5 | 3124241041102301 |
6 | 114255142340225 |
7 | 10212105123320 |
oct | 1362061632471 |
9 | 320221472208 |
10 | 101213222201 |
11 | 39a19252983 |
12 | 1774812a675 |
13 | 970cc832c0 |
14 | 4c822330b7 |
15 | 29759d7d1b |
hex | 1790c73539 |
101213222201 has 32 divisors (see below), whose sum is σ = 131951957760. Its totient is φ = 75339196416.
The previous prime is 101213222189. The next prime is 101213222203. The reversal of 101213222201 is 102222312101.
It is a cyclic number.
It is not a de Polignac number, because 101213222201 - 214 = 101213205817 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a self number, because there is not a number n which added to its sum of digits gives 101213222201.
It is not an unprimeable number, because it can be changed into a prime (101213222203) 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 31 ways as a sum of consecutive naturals, for example, 4175645 + ... + 4199813.
It is an arithmetic number, because the mean of its divisors is an integer number (4123498680).
Almost surely, 2101213222201 is an apocalyptic number.
It is an amenable number.
101213222201 is a deficient number, since it is larger than the sum of its proper divisors (30738735559).
101213222201 is a wasteful number, since it uses less digits than its factorization.
101213222201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26913.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 101213222201 its reverse (102222312101), we get a palindrome (203435534302).
The spelling of 101213222201 in words is "one hundred one billion, two hundred thirteen million, two hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •