Base | Representation |
---|---|
bin | 11110111000010111111… |
… | …010010111011110101001 |
3 | 21111212112211210122110000 |
4 | 132320113322113132221 |
5 | 234232042421130323 |
6 | 4302515225413213 |
7 | 306213663024432 |
oct | 36702772273651 |
9 | 7455484718400 |
10 | 2122115020713 |
11 | 748a90673306 |
12 | 2a334403a209 |
13 | 12516499848c |
14 | 749d4a72489 |
15 | 3a3039b5e43 |
hex | 1ee17e977a9 |
2122115020713 has 10 divisors (see below), whose sum is σ = 3170073055754. Its totient is φ = 1414743347088.
The previous prime is 2122115020679. The next prime is 2122115020723. The reversal of 2122115020713 is 3170205112212.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 1678403163024 + 443711857689 = 1295532^2 + 666117^2 .
It is not a de Polignac number, because 2122115020713 - 220 = 2122113972137 is a prime.
It is a super-2 number, since 2×21221150207132 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2122115020723) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 13099475356 + ... + 13099475517.
Almost surely, 22122115020713 is an apocalyptic number.
It is an amenable number.
2122115020713 is a deficient number, since it is larger than the sum of its proper divisors (1047958035041).
2122115020713 is an equidigital number, since it uses as much as digits as its factorization.
2122115020713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26198950885 (or 26198950876 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
The spelling of 2122115020713 in words is "two trillion, one hundred twenty-two billion, one hundred fifteen million, twenty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •