Base | Representation |
---|---|
bin | 1001001011111101100010… |
… | …0010101111111111001010 |
3 | 1022202122201002210022200200 |
4 | 2102333120202233333022 |
5 | 2310444023340213002 |
6 | 33252214244313030 |
7 | 2061531462462642 |
oct | 222773042577712 |
9 | 38678632708620 |
10 | 10101101101002 |
11 | 324494226664a |
12 | 11717b23a2776 |
13 | 5836b6b12b02 |
14 | 26cc784d7522 |
15 | 127b45b7eb1c |
hex | 92fd88affca |
10101101101002 has 48 divisors (see below), whose sum is σ = 23175167712840. Its totient is φ = 3168692084736.
The previous prime is 10101101100941. The next prime is 10101101101051. The reversal of 10101101101002 is 20010110110101.
It can be written as a sum of positive squares in 4 ways, for example, as 10070029635561 + 31071465441 = 3173331^2 + 176271^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 23 ways as a sum of consecutive naturals, for example, 2009788 + ... + 4923560.
Almost surely, 210101101101002 is an apocalyptic number.
10101101101002 is an abundant number, since it is smaller than the sum of its proper divisors (13074066611838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101101101002 is a wasteful number, since it uses less digits than its factorization.
10101101101002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2925127 (or 2925124 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10101101101002 its reverse (20010110110101), we get a palindrome (30111211211103).
Subtracting 10101101101002 from its reverse (20010110110101), we obtain a palindrome (9909009009099).
It can be divided in two parts, 1010110 and 1101002, that added together give a palindrome (2111112).
The spelling of 10101101101002 in words is "ten trillion, one hundred one billion, one hundred one million, one hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •