Base | Representation |
---|---|
bin | 11101011111000100011… |
… | …00011000111010000010 |
3 | 10120212000112100212102002 |
4 | 32233202030120322002 |
5 | 113044323211304442 |
6 | 2053230050424002 |
7 | 133123602503432 |
oct | 16574214307202 |
9 | 3525015325362 |
10 | 1013112213122 |
11 | 360727483769 |
12 | 144421292002 |
13 | 746c7999029 |
14 | 3706ba622c2 |
15 | 1b547981732 |
hex | ebe2318e82 |
1013112213122 has 8 divisors (see below), whose sum is σ = 1609060573836. Its totient is φ = 476758688512.
The previous prime is 1013112213121. The next prime is 1013112213143. The reversal of 1013112213122 is 2213122113101.
It can be written as a sum of positive squares in 2 ways, for example, as 1012581325441 + 530887681 = 1006271^2 + 23041^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1013112213094 and 1013112213103.
It is not an unprimeable number, because it can be changed into a prime (1013112213121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14898708983 + ... + 14898709050.
Almost surely, 21013112213122 is an apocalyptic number.
1013112213122 is a deficient number, since it is larger than the sum of its proper divisors (595948360714).
1013112213122 is a wasteful number, since it uses less digits than its factorization.
1013112213122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29797418052.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1013112213122 its reverse (2213122113101), we get a palindrome (3226234326223).
The spelling of 1013112213122 in words is "one trillion, thirteen billion, one hundred twelve million, two hundred thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.462 sec. • engine limits •