Base | Representation |
---|---|
bin | 11101101100001000000… |
… | …01011111101000000001 |
3 | 10121112010001221210100201 |
4 | 32312010001133220001 |
5 | 113203202242431340 |
6 | 2100345423445201 |
7 | 133462402625245 |
oct | 16660401375001 |
9 | 3545101853321 |
10 | 1020122233345 |
11 | 3636a4451706 |
12 | 145858a56801 |
13 | 7527409caa7 |
14 | 37534a6a425 |
15 | 1b8080c979a |
hex | ed8405fa01 |
1020122233345 has 4 divisors (see below), whose sum is σ = 1224146680020. Its totient is φ = 816097786672.
The previous prime is 1020122233313. The next prime is 1020122233379. The reversal of 1020122233345 is 5433322210201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 577540721521 + 442581511824 = 759961^2 + 665268^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020122233345 - 25 = 1020122233313 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 102012223330 + ... + 102012223339.
It is an arithmetic number, because the mean of its divisors is an integer number (306036670005).
Almost surely, 21020122233345 is an apocalyptic number.
It is an amenable number.
1020122233345 is a deficient number, since it is larger than the sum of its proper divisors (204024446675).
1020122233345 is an equidigital number, since it uses as much as digits as its factorization.
1020122233345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204024446674.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 1020122233345 its reverse (5433322210201), we get a palindrome (6453444443546).
The spelling of 1020122233345 in words is "one trillion, twenty billion, one hundred twenty-two million, two hundred thirty-three thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •