Base | Representation |
---|---|
bin | 101101101101000111000110… |
… | …110100100111001111111000 |
3 | 222100201120100212112022022111 |
4 | 231231013012310213033320 |
5 | 202321340240111213422 |
6 | 1551303403423102104 |
7 | 60224434141243336 |
oct | 5555070664471770 |
9 | 870646325468274 |
10 | 201012100101112 |
11 | 59059831150303 |
12 | 1a6655a9741934 |
13 | 882148a369a61 |
14 | 378d0750a4b56 |
15 | 1838bbcc4aa77 |
hex | b6d1c6d273f8 |
201012100101112 has 64 divisors (see below), whose sum is σ = 402177942144000. Its totient is φ = 93909866966784.
The previous prime is 201012100101103. The next prime is 201012100101133. The reversal of 201012100101112 is 211101001210102.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 201012100101092 and 201012100101101.
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, 583244313 + ... + 583588855.
It is an arithmetic number, because the mean of its divisors is an integer number (6284030346000).
Almost surely, 2201012100101112 is an apocalyptic number.
It is an amenable number.
201012100101112 is an abundant number, since it is smaller than the sum of its proper divisors (201165842042888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201012100101112 is a wasteful number, since it uses less digits than its factorization.
201012100101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 397220 (or 397216 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201012100101112 its reverse (211101001210102), we get a palindrome (412113101311214).
The spelling of 201012100101112 in words is "two hundred one trillion, twelve billion, one hundred million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •