Base | Representation |
---|---|
bin | 1001001101000100110000… |
… | …0111100100001101011000 |
3 | 1022211111001112101002010011 |
4 | 2103101030013210031120 |
5 | 2311302202310013422 |
6 | 33305055340531304 |
7 | 2063106325446334 |
oct | 223211407441530 |
9 | 38744045332104 |
10 | 10120220001112 |
11 | 3251a633a2241 |
12 | 1175449250b34 |
13 | 585442ab0960 |
14 | 26db6d7827c4 |
15 | 1283b43a4077 |
hex | 9344c1e4358 |
10120220001112 has 32 divisors (see below), whose sum is σ = 20542049498880. Its totient is φ = 4646415939840.
The previous prime is 10120220001083. The next prime is 10120220001119. The reversal of 10120220001112 is 21110002202101.
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 = 10120220001092 and 10120220001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120220001119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254717853 + ... + 254757580.
It is an arithmetic number, because the mean of its divisors is an integer number (641939046840).
Almost surely, 210120220001112 is an apocalyptic number.
It is an amenable number.
10120220001112 is an abundant number, since it is smaller than the sum of its proper divisors (10421829497768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10120220001112 is a wasteful number, since it uses less digits than its factorization.
10120220001112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 509475643 (or 509475639 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10120220001112 its reverse (21110002202101), we get a palindrome (31230222203213).
The spelling of 10120220001112 in words is "ten trillion, one hundred twenty billion, two hundred twenty million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •