Base | Representation |
---|---|
bin | 10111001100011101001001… |
… | …011011100001101110100101 |
3 | 111101012011012222222102222100 |
4 | 113030131021123201232211 |
5 | 101332322012022400401 |
6 | 1000543112340122313 |
7 | 30326023452615456 |
oct | 2714351133415645 |
9 | 441164188872870 |
10 | 102011000200101 |
11 | 2a55a693212123 |
12 | b5364b9696399 |
13 | 44bc799674a55 |
14 | 1b295045c512d |
15 | bbd81837ab86 |
hex | 5cc7496e1ba5 |
102011000200101 has 12 divisors (see below), whose sum is σ = 147349318201228. Its totient is φ = 68007289302144.
The previous prime is 102011000200093. The next prime is 102011000200139. The reversal of 102011000200101 is 101002000110201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 83516312903076 + 18494687297025 = 9138726^2 + 4300545^2 .
It is not a de Polignac number, because 102011000200101 - 23 = 102011000200093 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011000200171) 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, 17158371 + ... + 22325583.
Almost surely, 2102011000200101 is an apocalyptic number.
It is an amenable number.
102011000200101 is a deficient number, since it is larger than the sum of its proper divisors (45338318001127).
102011000200101 is a wasteful number, since it uses less digits than its factorization.
102011000200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7360772 (or 7360769 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102011000200101 its reverse (101002000110201), we get a palindrome (203013000310302).
The spelling of 102011000200101 in words is "one hundred two trillion, eleven billion, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •