Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …1110101001001111110001 |
3 | 1022210111221022200121210200 |
4 | 2103013300332221033301 |
5 | 2311120441324014301 |
6 | 33300303303345413 |
7 | 2062300504410015 |
oct | 223076076511761 |
9 | 38714838617720 |
10 | 10110101001201 |
11 | 32487404998a3 |
12 | 11734a4452269 |
13 | 5844bc559846 |
14 | 26d48d8c4545 |
15 | 127ec0d3bc86 |
hex | 931f0fa93f1 |
10110101001201 has 48 divisors (see below), whose sum is σ = 14835714138960. Its totient is φ = 6633965629440.
The previous prime is 10110101001197. The next prime is 10110101001233. The reversal of 10110101001201 is 10210010101101.
It can be written as a sum of positive squares in 8 ways, for example, as 40909107600 + 10069191893601 = 202260^2 + 3173199^2 .
It is not a de Polignac number, because 10110101001201 - 22 = 10110101001197 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 (10110101001281) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 67973751 + ... + 68122323.
It is an arithmetic number, because the mean of its divisors is an integer number (309077377895).
Almost surely, 210110101001201 is an apocalyptic number.
It is an amenable number.
10110101001201 is a deficient number, since it is larger than the sum of its proper divisors (4725613137759).
10110101001201 is a wasteful number, since it uses less digits than its factorization.
10110101001201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149186 (or 149183 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10110101001201 its reverse (10210010101101), we get a palindrome (20320111102302).
The spelling of 10110101001201 in words is "ten trillion, one hundred ten billion, one hundred one million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •