Base | Representation |
---|---|
bin | 100001010100111010101… |
… | …000010010110010100111 |
3 | 22002221102001121202211220 |
4 | 201110322220102302213 |
5 | 300010313002210043 |
6 | 4512034240031423 |
7 | 324314215042536 |
oct | 41247250226247 |
9 | 8087361552756 |
10 | 2290201210023 |
11 | 8032a5972151 |
12 | 30ba33902573 |
13 | 137c712947ac |
14 | 7cbbc48831d |
15 | 3e8902c6483 |
hex | 2153aa12ca7 |
2290201210023 has 8 divisors (see below), whose sum is σ = 3064391726208. Its totient is φ = 1521405750264.
The previous prime is 2290201210013. The next prime is 2290201210039. The reversal of 2290201210023 is 3200121020922.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2290201210023 - 214 = 2290201193639 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2290201209975 and 2290201210002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2290201210013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1348763115 + ... + 1348764812.
It is an arithmetic number, because the mean of its divisors is an integer number (383048965776).
Almost surely, 22290201210023 is an apocalyptic number.
2290201210023 is a deficient number, since it is larger than the sum of its proper divisors (774190516185).
2290201210023 is a wasteful number, since it uses less digits than its factorization.
2290201210023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2697528213.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 2290201210023 its reverse (3200121020922), we get a palindrome (5490322230945).
The spelling of 2290201210023 in words is "two trillion, two hundred ninety billion, two hundred one million, two hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •