Base | Representation |
---|---|
bin | 10011000000000101… |
… | …00010010011010000 |
3 | 222022221101021020211 |
4 | 21200002202103100 |
5 | 131343002241422 |
6 | 4404131213504 |
7 | 510536605120 |
oct | 114002422320 |
9 | 28287337224 |
10 | 10201212112 |
11 | 4365355713 |
12 | 1b88447294 |
13 | c675aa3b0 |
14 | 6cab7cc80 |
15 | 3ea8a6577 |
hex | 2600a24d0 |
10201212112 has 80 divisors (see below), whose sum is σ = 24467184000. Its totient is φ = 4012217856.
The previous prime is 10201212089. The next prime is 10201212137. The reversal of 10201212112 is 21121210201.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 10201212092 and 10201212101.
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, 231639 + ... + 272137.
It is an arithmetic number, because the mean of its divisors is an integer number (305839800).
Almost surely, 210201212112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10201212112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12233592000).
10201212112 is an abundant number, since it is smaller than the sum of its proper divisors (14265971888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10201212112 is a wasteful number, since it uses less digits than its factorization.
10201212112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40700 (or 40694 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10201212112 its reverse (21121210201), we get a palindrome (31322422313).
The spelling of 10201212112 in words is "ten billion, two hundred one million, two hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •