Base | Representation |
---|---|
bin | 101101101100111101110010… |
… | …110101000111001010101000 |
3 | 222100200121120000110220110211 |
4 | 231230331302311013022220 |
5 | 202321204300324323422 |
6 | 1551255031311550504 |
7 | 60223631304341422 |
oct | 5554756265071250 |
9 | 870617500426424 |
10 | 201002101011112 |
11 | 5905556a9a7a65 |
12 | 1a663678b2b434 |
13 | 882055590a85b |
14 | 378c7a70db812 |
15 | 18387d4ebc577 |
hex | b6cf72d472a8 |
201002101011112 has 16 divisors (see below), whose sum is σ = 377097927765300. Its totient is φ = 100442653607040.
The previous prime is 201002101011077. The next prime is 201002101011113. The reversal of 201002101011112 is 211110101200102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 196353911617956 + 4648189393156 = 14012634^2 + 2155966^2 .
It is a super-2 number, since 2×2010021010111122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201002101011092 and 201002101011101.
It is not an unprimeable number, because it can be changed into a prime (201002101011113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7299597687 + ... + 7299625222.
Almost surely, 2201002101011112 is an apocalyptic number.
It is an amenable number.
201002101011112 is a deficient number, since it is larger than the sum of its proper divisors (176095826754188).
201002101011112 is a wasteful number, since it uses less digits than its factorization.
201002101011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14599224636 (or 14599224632 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201002101011112 its reverse (211110101200102), we get a palindrome (412112202211214).
The spelling of 201002101011112 in words is "two hundred one trillion, two billion, one hundred one million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •