Base | Representation |
---|---|
bin | 101111000101000000… |
… | …1111100001010101001 |
3 | 100122221211111202022100 |
4 | 1132022001330022221 |
5 | 3124023100342301 |
6 | 114240020044013 |
7 | 10206231632106 |
oct | 1361201741251 |
9 | 318854452270 |
10 | 101100012201 |
11 | 399703595a1 |
12 | 17716233609 |
13 | 96c2695b36 |
14 | 4c711a3aad |
15 | 296aac4286 |
hex | 178a07c2a9 |
101100012201 has 12 divisors (see below), whose sum is σ = 146057249520. Its totient is φ = 67388978040.
The previous prime is 101100012179. The next prime is 101100012203. The reversal of 101100012201 is 102210001101.
It is a happy number.
It is not a de Polignac number, because 101100012201 - 26 = 101100012137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (101100012203) 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 11 ways as a sum of consecutive naturals, for example, 860931 + ... + 971288.
It is an arithmetic number, because the mean of its divisors is an integer number (12171437460).
Almost surely, 2101100012201 is an apocalyptic number.
It is an amenable number.
101100012201 is a deficient number, since it is larger than the sum of its proper divisors (44957237319).
101100012201 is a wasteful number, since it uses less digits than its factorization.
101100012201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838356 (or 1838353 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101100012201 its reverse (102210001101), we get a palindrome (203310013302).
It can be divided in two parts, 1011000 and 12201, that added together give a palindrome (1023201).
The spelling of 101100012201 in words is "one hundred one billion, one hundred million, twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •