Base | Representation |
---|---|
bin | 11111000001100110011… |
… | …011010110000111000101 |
3 | 21112211010021221200110012 |
4 | 133001212123112013011 |
5 | 234412340142121201 |
6 | 4311234255240005 |
7 | 310014332613125 |
oct | 37014633260705 |
9 | 7484107850405 |
10 | 2132022223301 |
11 | 752204a66243 |
12 | 2a5249b19005 |
13 | 126083394629 |
14 | 7529475ac85 |
15 | 3a6d36435bb |
hex | 1f0666d61c5 |
2132022223301 has 8 divisors (see below), whose sum is σ = 2132560832280. Its totient is φ = 2131483698432.
The previous prime is 2132022223159. The next prime is 2132022223319. The reversal of 2132022223301 is 1033222202312.
It can be written as a sum of positive squares in 4 ways, for example, as 630159718276 + 1501862505025 = 793826^2 + 1225505^2 .
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 2132022223301 - 230 = 2130948481477 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 (2132022223381) 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, 97212905 + ... + 97234833.
It is an arithmetic number, because the mean of its divisors is an integer number (266570104035).
Almost surely, 22132022223301 is an apocalyptic number.
It is an amenable number.
2132022223301 is a deficient number, since it is larger than the sum of its proper divisors (538608979).
2132022223301 is a wasteful number, since it uses less digits than its factorization.
2132022223301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42055.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 2132022223301 its reverse (1033222202312), we get a palindrome (3165244425613).
The spelling of 2132022223301 in words is "two trillion, one hundred thirty-two billion, twenty-two million, two hundred twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •