Base | Representation |
---|---|
bin | 1010100110001011101110… |
… | …11011010001110000011001 |
3 | 10001111200001110122101012010 |
4 | 11103011313123101300121 |
5 | 11023240402003020441 |
6 | 121320514454340133 |
7 | 4623346161201615 |
oct | 523056733216031 |
9 | 101450043571163 |
10 | 23302201220121 |
11 | 747445411329a |
12 | 274415805a649 |
13 | 10005079b0345 |
14 | 5a7b92770345 |
15 | 2a6225147116 |
hex | 1531776d1c19 |
23302201220121 has 8 divisors (see below), whose sum is σ = 31175641224000. Its totient is φ = 15481781014832.
The previous prime is 23302201220107. The next prime is 23302201220197. The reversal of 23302201220121 is 12102210220332.
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 23302201220121 - 213 = 23302201211929 is a prime.
It is not an unprimeable number, because it can be changed into a prime (23302201920121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13254948621 + ... + 13254950378.
It is an arithmetic number, because the mean of its divisors is an integer number (3896955153000).
Almost surely, 223302201220121 is an apocalyptic number.
It is an amenable number.
23302201220121 is a deficient number, since it is larger than the sum of its proper divisors (7873440003879).
23302201220121 is a wasteful number, since it uses less digits than its factorization.
23302201220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26509899295.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 23302201220121 its reverse (12102210220332), we get a palindrome (35404411440453).
The spelling of 23302201220121 in words is "twenty-three trillion, three hundred two billion, two hundred one million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •