Base | Representation |
---|---|
bin | 100000000101110111000… |
… | …001110111100100011111 |
3 | 21210211022012121201221022 |
4 | 200011313001313210133 |
5 | 242112441142420221 |
6 | 4405035142154355 |
7 | 315220523630555 |
oct | 40056701674437 |
9 | 7724265551838 |
10 | 2205315201311 |
11 | 7802a5a36442 |
12 | 2b74a37229bb |
13 | 12cc63b03081 |
14 | 78a48841bd5 |
15 | 3c572dbb4ab |
hex | 2017707791f |
2205315201311 has 4 divisors (see below), whose sum is σ = 2205365810472. Its totient is φ = 2205264592152.
The previous prime is 2205315201307. The next prime is 2205315201371. The reversal of 2205315201311 is 1131025135022.
2205315201311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2205315201311 - 22 = 2205315201307 is a prime.
It is a super-2 number, since 2×22053152013112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2205315201371) 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, 25239161 + ... + 25326386.
It is an arithmetic number, because the mean of its divisors is an integer number (551341452618).
Almost surely, 22205315201311 is an apocalyptic number.
2205315201311 is a deficient number, since it is larger than the sum of its proper divisors (50609161).
2205315201311 is an equidigital number, since it uses as much as digits as its factorization.
2205315201311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50609160.
The product of its (nonzero) digits is 1800, while the sum is 26.
The spelling of 2205315201311 in words is "two trillion, two hundred five billion, three hundred fifteen million, two hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •