Base | Representation |
---|---|
bin | 11101011101001110000… |
… | …11110111001100000000 |
3 | 10120202110101120102101121 |
4 | 32232213003313030000 |
5 | 113040310222401422 |
6 | 2052543410442024 |
7 | 133060165043011 |
oct | 16564703671400 |
9 | 3522411512347 |
10 | 1012120122112 |
11 | 360268472040 |
12 | 1441a4b93314 |
13 | 7459a29aa28 |
14 | 36db5db3008 |
15 | 1b4da8138c7 |
hex | eba70f7300 |
1012120122112 has 36 divisors (see below), whose sum is σ = 2203949078856. Its totient is φ = 460054599680.
The previous prime is 1012120122061. The next prime is 1012120122113. The reversal of 1012120122112 is 2112210212101.
1012120122112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (1012120122113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 179706013 + ... + 179711644.
It is an arithmetic number, because the mean of its divisors is an integer number (61220807746).
Almost surely, 21012120122112 is an apocalyptic number.
It is an amenable number.
1012120122112 is an abundant number, since it is smaller than the sum of its proper divisors (1191828956744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012120122112 is an equidigital number, since it uses as much as digits as its factorization.
1012120122112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 359417684 (or 359417670 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1012120122112 its reverse (2112210212101), we get a palindrome (3124330334213).
The spelling of 1012120122112 in words is "one trillion, twelve billion, one hundred twenty million, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •