Base | Representation |
---|---|
bin | 1010100011111000110100… |
… | …11001101100100000110011 |
3 | 10001020010110212121210211222 |
4 | 11101330122121230200303 |
5 | 11020442340231104021 |
6 | 121220352342255255 |
7 | 4614554536304441 |
oct | 521743231544063 |
9 | 101203425553758 |
10 | 23223331113011 |
11 | 7443a60a89497 |
12 | 2730a0672752b |
13 | cc5c48994503 |
14 | 5a402dab5b91 |
15 | 2a415ae666ab |
hex | 151f1a66c833 |
23223331113011 has 8 divisors (see below), whose sum is σ = 23241345778800. Its totient is φ = 23205321627040.
The previous prime is 23223331113007. The next prime is 23223331113023. The reversal of 23223331113011 is 11031113332232.
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 23223331113011 - 22 = 23223331113007 is a prime.
It is a super-2 number, since 2×232233311130112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23223331113511) 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, 7699580 + ... + 10282518.
It is an arithmetic number, because the mean of its divisors is an integer number (2905168222350).
Almost surely, 223223331113011 is an apocalyptic number.
23223331113011 is a deficient number, since it is larger than the sum of its proper divisors (18014665789).
23223331113011 is a wasteful number, since it uses less digits than its factorization.
23223331113011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2589909.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 23223331113011 its reverse (11031113332232), we get a palindrome (34254444445243).
The spelling of 23223331113011 in words is "twenty-three trillion, two hundred twenty-three billion, three hundred thirty-one million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •