Base | Representation |
---|---|
bin | 101101101111111000000100… |
… | …111101101000000001100010 |
3 | 222101101201211202202220101100 |
4 | 231233320010331220001202 |
5 | 202332443421012241002 |
6 | 1551530551203015230 |
7 | 60244242062112231 |
oct | 5557700475500142 |
9 | 871351752686340 |
10 | 201202121212002 |
11 | 59122382106409 |
12 | 1a69639b36a516 |
13 | 8836381180701 |
14 | 379833db5ab18 |
15 | 183dae00d211c |
hex | b6fe04f68062 |
201202121212002 has 48 divisors (see below), whose sum is σ = 436015606178880. Its totient is φ = 67055424470496.
The previous prime is 201202121211961. The next prime is 201202121212003. The reversal of 201202121212002 is 200212121202102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (201202121212003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4041558003 + ... + 4041607785.
It is an arithmetic number, because the mean of its divisors is an integer number (9083658462060).
Almost surely, 2201202121212002 is an apocalyptic number.
201202121212002 is an abundant number, since it is smaller than the sum of its proper divisors (234813484966878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201202121212002 is a wasteful number, since it uses less digits than its factorization.
201202121212002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85287 (or 85284 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 201202121212002 its reverse (200212121202102), we get a palindrome (401414242414104).
The spelling of 201202121212002 in words is "two hundred one trillion, two hundred two billion, one hundred twenty-one million, two hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •