Base | Representation |
---|---|
bin | 1010100110110000110100… |
… | …10001011101000001011111 |
3 | 10001120120110011112202211122 |
4 | 11103120122101131001133 |
5 | 11024102141434401343 |
6 | 121334010401241155 |
7 | 4624652464221005 |
oct | 523303221350137 |
9 | 101516404482748 |
10 | 23322113200223 |
11 | 74819419936a2 |
12 | 2747b946331bb |
13 | 100235c07a3a6 |
14 | 5a8b210a2a75 |
15 | 2a69dd2c8068 |
hex | 15361a45d05f |
23322113200223 has 8 divisors (see below), whose sum is σ = 24577458459120. Its totient is φ = 22069554503040.
The previous prime is 23322113200207. The next prime is 23322113200229. The reversal of 23322113200223 is 32200231122332.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23322113200223 - 24 = 23322113200207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23322113200192 and 23322113200201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23322113200229) 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, 696623240 + ... + 696656717.
It is an arithmetic number, because the mean of its divisors is an integer number (3072182307390).
Almost surely, 223322113200223 is an apocalyptic number.
23322113200223 is a deficient number, since it is larger than the sum of its proper divisors (1255345258897).
23322113200223 is a wasteful number, since it uses less digits than its factorization.
23322113200223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1393280857.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 23322113200223 its reverse (32200231122332), we get a palindrome (55522344322555).
The spelling of 23322113200223 in words is "twenty-three trillion, three hundred twenty-two billion, one hundred thirteen million, two hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •