Base | Representation |
---|---|
bin | 100001011110001111111… |
… | …011000010000100010111 |
3 | 22010220021102201202100211 |
4 | 201132033323002010113 |
5 | 300141323330321330 |
6 | 4520412450550251 |
7 | 325120435264255 |
oct | 41361773020427 |
9 | 8126242652324 |
10 | 2300222120215 |
11 | 807578469308 |
12 | 31196b898387 |
13 | 138baa3c3756 |
14 | 7d48d2d15d5 |
15 | 3ec79e14d2a |
hex | 2178fec2117 |
2300222120215 has 4 divisors (see below), whose sum is σ = 2760266544264. Its totient is φ = 1840177696168.
The previous prime is 2300222120201. The next prime is 2300222120219. The reversal of 2300222120215 is 5120212220032.
2300222120215 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 2300222120215 - 237 = 2162783166743 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2300222120219) 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, 230022212017 + ... + 230022212026.
It is an arithmetic number, because the mean of its divisors is an integer number (690066636066).
Almost surely, 22300222120215 is an apocalyptic number.
2300222120215 is a deficient number, since it is larger than the sum of its proper divisors (460044424049).
2300222120215 is an equidigital number, since it uses as much as digits as its factorization.
2300222120215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460044424048.
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 2300222120215 its reverse (5120212220032), we get a palindrome (7420434340247).
The spelling of 2300222120215 in words is "two trillion, three hundred billion, two hundred twenty-two million, one hundred twenty thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •