Base | Representation |
---|---|
bin | 101101111011100000000110… |
… | …011100100000000011100110 |
3 | 222111020002220200222020012200 |
4 | 231323200012130200003212 |
5 | 202434041032030000402 |
6 | 1553341552150155330 |
7 | 60356043223553355 |
oct | 5573400634400346 |
9 | 874202820866180 |
10 | 202001010000102 |
11 | 59400168a98165 |
12 | 1a7a5195652b46 |
13 | 88937c8b52041 |
14 | 37c4c886a599c |
15 | 185479aa7621c |
hex | b7b8067200e6 |
202001010000102 has 12 divisors (see below), whose sum is σ = 437668855000260. Its totient is φ = 67333670000028.
The previous prime is 202001010000071. The next prime is 202001010000161. The reversal of 202001010000102 is 201000010100202.
It is a super-3 number, since 3×2020010100001023 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5611139166652 + ... + 5611139166687.
It is an arithmetic number, because the mean of its divisors is an integer number (36472404583355).
Almost surely, 2202001010000102 is an apocalyptic number.
202001010000102 is an abundant number, since it is smaller than the sum of its proper divisors (235667845000158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202001010000102 is a wasteful number, since it uses less digits than its factorization.
202001010000102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11222278333347 (or 11222278333344 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 202001010000102 its reverse (201000010100202), we get a palindrome (403001020100304).
The spelling of 202001010000102 in words is "two hundred two trillion, one billion, ten million, one hundred two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •