Base | Representation |
---|---|
bin | 11101001000101101100… |
… | …11100111100101011010 |
3 | 10112201001002002210020000 |
4 | 32210112303213211122 |
5 | 112400233130311302 |
6 | 2043523101513430 |
7 | 132220303453251 |
oct | 16442663474532 |
9 | 3481032083200 |
10 | 1001110010202 |
11 | 356628557aa5 |
12 | 142031872876 |
13 | 73534242903 |
14 | 3664da2d798 |
15 | 1b093e2831c |
hex | e916ce795a |
1001110010202 has 80 divisors (see below), whose sum is σ = 2305788147432. Its totient is φ = 324452459520.
The previous prime is 1001110010189. The next prime is 1001110010213. The reversal of 1001110010202 is 2020100111001.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 685300853241 + 315809156961 = 827829^2 + 561969^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1688898 + ... + 2203314.
Almost surely, 21001110010202 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1001110010202, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1152894073716).
1001110010202 is an abundant number, since it is smaller than the sum of its proper divisors (1304678137230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001110010202 is a wasteful number, since it uses less digits than its factorization.
1001110010202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 514765 (or 514756 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1001110010202 its reverse (2020100111001), we get a palindrome (3021210121203).
The spelling of 1001110010202 in words is "one trillion, one billion, one hundred ten million, ten thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •