Base | Representation |
---|---|
bin | 101101111011100000000110… |
… | …011100100000010001101010 |
3 | 222111020002220200222021110000 |
4 | 231323200012130200101222 |
5 | 202434041032030013002 |
6 | 1553341552150203430 |
7 | 60356043223556112 |
oct | 5573400634402152 |
9 | 874202820867400 |
10 | 202001010001002 |
11 | 59400168a98903 |
12 | 1a7a5195653576 |
13 | 88937c8b52584 |
14 | 37c4c886a6042 |
15 | 185479aa7661c |
hex | b7b80672046a |
202001010001002 has 20 divisors (see below), whose sum is σ = 452631892780386. Its totient is φ = 67333670000280.
The previous prime is 202001010001001. The next prime is 202001010001019. The reversal of 202001010001002 is 200100010100202.
It can be written as a sum of positive squares in only one way, i.e., 125102860433721 + 76898149567281 = 11184939^2 + 8769159^2 .
It is a super-4 number, since 4×2020010100010024 (a number of 58 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (202001010001001) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 623459907249 + ... + 623459907572.
Almost surely, 2202001010001002 is an apocalyptic number.
202001010001002 is an abundant number, since it is smaller than the sum of its proper divisors (250630882779384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202001010001002 is a wasteful number, since it uses less digits than its factorization.
202001010001002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1246919814835 (or 1246919814826 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 202001010001002 its reverse (200100010100202), we get a palindrome (402101020101204).
The spelling of 202001010001002 in words is "two hundred two trillion, one billion, ten million, one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •