Base | Representation |
---|---|
bin | 100001011111000101101… |
… | …000110110000100001001 |
3 | 22010222121020111112222012 |
4 | 201133011220312010021 |
5 | 300200200032301441 |
6 | 4521042122505305 |
7 | 325151660340131 |
oct | 41370550660411 |
9 | 8128536445865 |
10 | 2301123322121 |
11 | 8079a0141678 |
12 | 311b81665235 |
13 | 138cc201b210 |
14 | 7d536c81ac1 |
15 | 3ecce0cc9eb |
hex | 217c5a36109 |
2301123322121 has 8 divisors (see below), whose sum is σ = 2479223087880. Its totient is φ = 2123179310592.
The previous prime is 2301123322079. The next prime is 2301123322133. The reversal of 2301123322121 is 1212233211032.
It can be written as a sum of positive squares in 4 ways, for example, as 105258718096 + 2195864604025 = 324436^2 + 1481845^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 2301123322121 - 226 = 2301056213257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2301123321121) 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, 38907866 + ... + 38966963.
It is an arithmetic number, because the mean of its divisors is an integer number (309902885985).
Almost surely, 22301123322121 is an apocalyptic number.
It is an amenable number.
2301123322121 is a deficient number, since it is larger than the sum of its proper divisors (178099765759).
2301123322121 is a wasteful number, since it uses less digits than its factorization.
2301123322121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77877115.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 2301123322121 its reverse (1212233211032), we get a palindrome (3513356533153).
The spelling of 2301123322121 in words is "two trillion, three hundred one billion, one hundred twenty-three million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •