Base | Representation |
---|---|
bin | 11101011101001110010… |
… | …11000111000011011101 |
3 | 10120202110112010221200212 |
4 | 32232213023013003131 |
5 | 113040311214201414 |
6 | 2052543515302205 |
7 | 133060220145242 |
oct | 16564713070335 |
9 | 3522415127625 |
10 | 1012122022109 |
11 | 36026954a590 |
12 | 1441a574a965 |
13 | 7459a7b47a3 |
14 | 36db63495c9 |
15 | 1b4daa8b83e |
hex | eba72c70dd |
1012122022109 has 16 divisors (see below), whose sum is σ = 1162291130880. Its totient is φ = 871649728560.
The previous prime is 1012122022063. The next prime is 1012122022169. The reversal of 1012122022109 is 9012202212101.
It is a cyclic number.
It is not a de Polignac number, because 1012122022109 - 224 = 1012105244893 is a prime.
It is a super-2 number, since 2×10121220221092 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012122022169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6228872 + ... + 6389294.
It is an arithmetic number, because the mean of its divisors is an integer number (72643195680).
Almost surely, 21012122022109 is an apocalyptic number.
1012122022109 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1012122022109 is a deficient number, since it is larger than the sum of its proper divisors (150169108771).
1012122022109 is a wasteful number, since it uses less digits than its factorization.
1012122022109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190640.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 1012122022109 in words is "one trillion, twelve billion, one hundred twenty-two million, twenty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •