Base | Representation |
---|---|
bin | 10001100110111001101… |
… | …000001010000100000000 |
3 | 11021200012222200221121111 |
4 | 101212321220022010000 |
5 | 124311040012401422 |
6 | 2323511045533104 |
7 | 153263634224005 |
oct | 21467150120400 |
9 | 4250188627544 |
10 | 1210000122112 |
11 | 427181584921 |
12 | 17660a714194 |
13 | 8a144318922 |
14 | 427c86bd8ac |
15 | 2171cabea77 |
hex | 119b9a0a100 |
1210000122112 has 36 divisors (see below), whose sum is σ = 2425820845420. Its totient is φ = 602358110208.
The previous prime is 1210000122109. The next prime is 1210000122113. The reversal of 1210000122112 is 2112210000121.
It can be written as a sum of positive squares in 2 ways, for example, as 630842593536 + 579157528576 = 794256^2 + 761024^2 .
It is a super-2 number, since 2×12100001221122 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210000122092 and 1210000122101.
It is not an unprimeable number, because it can be changed into a prime (1210000122113) 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, 10261383 + ... + 10378630.
Almost surely, 21210000122112 is an apocalyptic number.
It is an amenable number.
1210000122112 is an abundant number, since it is smaller than the sum of its proper divisors (1215820723308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210000122112 is an equidigital number, since it uses as much as digits as its factorization.
1210000122112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20640258 (or 20640244 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1210000122112 its reverse (2112210000121), we get a palindrome (3322210122233).
The spelling of 1210000122112 in words is "one trillion, two hundred ten billion, one hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •