Base | Representation |
---|---|
bin | 1011101100110100100… |
… | …0010101101110000100 |
3 | 201012211201210120010200 |
4 | 2323031020111232010 |
5 | 11243132030323022 |
6 | 232202010050500 |
7 | 20344133621346 |
oct | 2731510255604 |
9 | 635751716120 |
10 | 201010011012 |
11 | 7827aa02448 |
12 | 32b59a19a30 |
13 | 15c55652c25 |
14 | 9a2c2b7296 |
15 | 5366e81bac |
hex | 2ecd215b84 |
201010011012 has 36 divisors (see below), whose sum is σ = 508463346300. Its totient is φ = 66956562432.
The previous prime is 201010010983. The next prime is 201010011067. The reversal of 201010011012 is 210110010102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 137955787776 + 63054223236 = 371424^2 + 251106^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×2010100110122 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 201010010985 and 201010011003.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1896637 + ... + 1999812.
Almost surely, 2201010011012 is an apocalyptic number.
It is an amenable number.
201010011012 is an abundant number, since it is smaller than the sum of its proper divisors (307453335288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201010011012 is a wasteful number, since it uses less digits than its factorization.
201010011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3897892 (or 3897887 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 201010011012 its reverse (210110010102), we get a palindrome (411120021114).
The spelling of 201010011012 in words is "two hundred one billion, ten million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •