Base | Representation |
---|---|
bin | 1010000110001010100100… |
… | …0101101000111111111111 |
3 | 1110022020201000210100210002 |
4 | 2201202221011220333333 |
5 | 2423334403233233043 |
6 | 35335424400504515 |
7 | 2224010633556161 |
oct | 241425105507777 |
9 | 43266630710702 |
10 | 11101032321023 |
11 | 359aa15384087 |
12 | 12b355531b13b |
13 | 626a90a79228 |
14 | 2a5415758931 |
15 | 143b6b35bbb8 |
hex | a18a9168fff |
11101032321023 has 4 divisors (see below), whose sum is σ = 11101819251720. Its totient is φ = 11100245390328.
The previous prime is 11101032321011. The next prime is 11101032321061. The reversal of 11101032321023 is 32012323010111.
It is a happy number.
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 11101032321023 - 216 = 11101032255487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101032320986 and 11101032321004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101032321083) 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, 393444188 + ... + 393472401.
It is an arithmetic number, because the mean of its divisors is an integer number (2775454812930).
Almost surely, 211101032321023 is an apocalyptic number.
11101032321023 is a deficient number, since it is larger than the sum of its proper divisors (786930697).
11101032321023 is an equidigital number, since it uses as much as digits as its factorization.
11101032321023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 786930696.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11101032321023 its reverse (32012323010111), we get a palindrome (43113355331134).
The spelling of 11101032321023 in words is "eleven trillion, one hundred one billion, thirty-two million, three hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •