Base | Representation |
---|---|
bin | 1010000001100111111000… |
… | …1100101010110110110111 |
3 | 1110000210022001111000120112 |
4 | 2200121332030222312313 |
5 | 2421100102323111043 |
6 | 35235521532453235 |
7 | 2215246204241264 |
oct | 240317614526667 |
9 | 43023261430515 |
10 | 11023003332023 |
11 | 356a914014811 |
12 | 12a03b961a21b |
13 | 61c6070aba17 |
14 | 2a173269026b |
15 | 141b00e26518 |
hex | a067e32adb7 |
11023003332023 has 8 divisors (see below), whose sum is σ = 11039787426960. Its totient is φ = 11006222722560.
The previous prime is 11023003331987. The next prime is 11023003332041. The reversal of 11023003332023 is 32023330032011.
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 11023003332023 - 222 = 11022999137719 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11023003332023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11023003332323) 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, 5493911 + ... + 7226967.
It is an arithmetic number, because the mean of its divisors is an integer number (1379973428370).
Almost surely, 211023003332023 is an apocalyptic number.
11023003332023 is a deficient number, since it is larger than the sum of its proper divisors (16784094937).
11023003332023 is an equidigital number, since it uses as much as digits as its factorization.
11023003332023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1742737.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 11023003332023 its reverse (32023330032011), we get a palindrome (43046333364034).
The spelling of 11023003332023 in words is "eleven trillion, twenty-three billion, three million, three hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •