Base | Representation |
---|---|
bin | 11110111000010100001… |
… | …111100011010011011001 |
3 | 21111212101112222022022002 |
4 | 132320110033203103121 |
5 | 234231431141342210 |
6 | 4302505150210345 |
7 | 306212314561544 |
oct | 36702417432331 |
9 | 7455345868262 |
10 | 2122053465305 |
11 | 748a5994a874 |
12 | 2a33274b39b5 |
13 | 125154cc5567 |
14 | 749ca80b85b |
15 | 3a2ed3a74a5 |
hex | 1ee143e34d9 |
2122053465305 has 4 divisors (see below), whose sum is σ = 2546464158372. Its totient is φ = 1697642772240.
The previous prime is 2122053465281. The next prime is 2122053465331. The reversal of 2122053465305 is 5035643502212.
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 1244509811776 + 877543653529 = 1115576^2 + 936773^2 .
It is not a de Polignac number, because 2122053465305 - 216 = 2122053399769 is a prime.
It is a super-2 number, since 2×21220534653052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 212205346526 + ... + 212205346535.
It is an arithmetic number, because the mean of its divisors is an integer number (636616039593).
Almost surely, 22122053465305 is an apocalyptic number.
It is an amenable number.
2122053465305 is a deficient number, since it is larger than the sum of its proper divisors (424410693067).
2122053465305 is an equidigital number, since it uses as much as digits as its factorization.
2122053465305 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 424410693066.
The product of its (nonzero) digits is 216000, while the sum is 38.
Adding to 2122053465305 its reverse (5035643502212), we get a palindrome (7157696967517).
The spelling of 2122053465305 in words is "two trillion, one hundred twenty-two billion, fifty-three million, four hundred sixty-five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •