Base | Representation |
---|---|
bin | 11110111111111011001… |
… | …100101100010110010001 |
3 | 21112122110220210212000111 |
4 | 132333323030230112101 |
5 | 234400144121020423 |
6 | 4310335552321321 |
7 | 306621626416642 |
oct | 36777314542621 |
9 | 7478426725014 |
10 | 2130223220113 |
11 | 75147152254a |
12 | 2a4a27543241 |
13 | 125b577631c1 |
14 | 751638636c9 |
15 | 3a62a73560d |
hex | 1effb32c591 |
2130223220113 has 8 divisors (see below), whose sum is σ = 2201842287360. Its totient is φ = 2059787939280.
The previous prime is 2130223220107. The next prime is 2130223220119. The reversal of 2130223220113 is 3110223220312.
It is an interprime number because it is at equal distance from previous prime (2130223220107) and next prime (2130223220119).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2130223220113 - 29 = 2130223219601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2130223220119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 295942945 + ... + 295950142.
It is an arithmetic number, because the mean of its divisors is an integer number (275230285920).
Almost surely, 22130223220113 is an apocalyptic number.
It is an amenable number.
2130223220113 is a deficient number, since it is larger than the sum of its proper divisors (71619067247).
2130223220113 is an equidigital number, since it uses as much as digits as its factorization.
2130223220113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591893207.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 2130223220113 its reverse (3110223220312), we get a palindrome (5240446440425).
The spelling of 2130223220113 in words is "two trillion, one hundred thirty billion, two hundred twenty-three million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •