Base | Representation |
---|---|
bin | 10000000010010100111… |
… | …010100111000100000101 |
3 | 10220100110222021100221200 |
4 | 100002110322213010011 |
5 | 121023404031120401 |
6 | 2202131215133113 |
7 | 142421556421314 |
oct | 20022472470405 |
9 | 3810428240850 |
10 | 1102010020101 |
11 | 3953a5a21931 |
12 | 1596b0b14199 |
13 | 7cbc4350393 |
14 | 3b4a241027b |
15 | 1d9ec192686 |
hex | 10094ea7105 |
1102010020101 has 12 divisors (see below), whose sum is σ = 1592201608140. Its totient is φ = 734484412800.
The previous prime is 1102010020057. The next prime is 1102010020103. The reversal of 1102010020101 is 1010200102011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 661115348100 + 440894672001 = 813090^2 + 663999^2 .
It is not a de Polignac number, because 1102010020101 - 215 = 1102009987333 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102010020103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15707550 + ... + 15777551.
It is an arithmetic number, because the mean of its divisors is an integer number (132683467345).
Almost surely, 21102010020101 is an apocalyptic number.
It is an amenable number.
1102010020101 is a deficient number, since it is larger than the sum of its proper divisors (490191588039).
1102010020101 is a wasteful number, since it uses less digits than its factorization.
1102010020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31488996 (or 31488993 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1102010020101 its reverse (1010200102011), we get a palindrome (2112210122112).
The spelling of 1102010020101 in words is "one trillion, one hundred two billion, ten million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •