Base | Representation |
---|---|
bin | 10011000001010000… |
… | …10101101101011100 |
3 | 222100122000202002011 |
4 | 21200220111231130 |
5 | 131403021401022 |
6 | 4405123441004 |
7 | 511020051010 |
oct | 114050255534 |
9 | 28318022064 |
10 | 10211122012 |
11 | 436aa04113 |
12 | 1b8b826164 |
13 | c69669c40 |
14 | 6cc1dc540 |
15 | 3eb6b2977 |
hex | 260a15b5c |
10211122012 has 96 divisors (see below), whose sum is σ = 23549823360. Its totient is φ = 3759022080.
The previous prime is 10211121997. The next prime is 10211122043. The reversal of 10211122012 is 21022111201.
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 = 10211121983 and 10211122001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 541462 + ... + 560002.
It is an arithmetic number, because the mean of its divisors is an integer number (245310660).
Almost surely, 210211122012 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 10211122012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11774911680).
10211122012 is an abundant number, since it is smaller than the sum of its proper divisors (13338701348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211122012 is a wasteful number, since it uses less digits than its factorization.
10211122012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18671 (or 18669 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10211122012 its reverse (21022111201), we get a palindrome (31233233213).
The spelling of 10211122012 in words is "ten billion, two hundred eleven million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •