Base | Representation |
---|---|
bin | 1010100011111000011010… |
… | …11011000000111100100011 |
3 | 10001020002220200212120002001 |
4 | 11101330031123000330203 |
5 | 11020441414004330133 |
6 | 121220315003104431 |
7 | 4614546253346530 |
oct | 521741533007443 |
9 | 101202820776061 |
10 | 23223113355043 |
11 | 744395a077728 |
12 | 2730965812117 |
13 | cc5c12830444 |
14 | 5a400cbcdd87 |
15 | 2a4146ca087d |
hex | 151f0d6c0f23 |
23223113355043 has 4 divisors (see below), whose sum is σ = 26540700977200. Its totient is φ = 19905525732888.
The previous prime is 23223113355011. The next prime is 23223113355053. The reversal of 23223113355043 is 34055331132232.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23223113355043 - 25 = 23223113355011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23223113354993 and 23223113355011.
It is not an unprimeable number, because it can be changed into a prime (23223113355053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1658793811068 + ... + 1658793811081.
It is an arithmetic number, because the mean of its divisors is an integer number (6635175244300).
Almost surely, 223223113355043 is an apocalyptic number.
23223113355043 is a deficient number, since it is larger than the sum of its proper divisors (3317587622157).
23223113355043 is an equidigital number, since it uses as much as digits as its factorization.
23223113355043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3317587622156.
The product of its (nonzero) digits is 194400, while the sum is 37.
Adding to 23223113355043 its reverse (34055331132232), we get a palindrome (57278444487275).
The spelling of 23223113355043 in words is "twenty-three trillion, two hundred twenty-three billion, one hundred thirteen million, three hundred fifty-five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •