Base | Representation |
---|---|
bin | 101101101101000111001100… |
… | …110110010001110101111100 |
3 | 222100201120121220202201022112 |
4 | 231231013030312101311330 |
5 | 202321340442001413040 |
6 | 1551303421434033152 |
7 | 60224436506466266 |
oct | 5555071466216574 |
9 | 870646556681275 |
10 | 201012201201020 |
11 | 59059883223150 |
12 | 1a6656175787b8 |
13 | 88214a52a70a1 |
14 | 378d0846a0b36 |
15 | 1838bc6a6b365 |
hex | b6d1ccd91d7c |
201012201201020 has 48 divisors (see below), whose sum is σ = 460810364249088. Its totient is φ = 73046189520960.
The previous prime is 201012201201013. The next prime is 201012201201079. The reversal of 201012201201020 is 20102102210102.
It is a junction number, because it is equal to n+sod(n) for n = 201012201200986 and 201012201201004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 306899432 + ... + 307553711.
It is an arithmetic number, because the mean of its divisors is an integer number (9600215921856).
Almost surely, 2201012201201020 is an apocalyptic number.
201012201201020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201012201201020 is an abundant number, since it is smaller than the sum of its proper divisors (259798163048068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201012201201020 is a wasteful number, since it uses less digits than its factorization.
201012201201020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614454650 (or 614454648 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 201012201201020 its reverse (20102102210102), we get a palindrome (221114303411122).
The spelling of 201012201201020 in words is "two hundred one trillion, twelve billion, two hundred one million, two hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •