Base | Representation |
---|---|
bin | 1010000010001001011111… |
… | …0101000111101111111001 |
3 | 1110001122120200010221000210 |
4 | 2200202113311013233321 |
5 | 2421222040431113423 |
6 | 35244012550021333 |
7 | 2216015551562253 |
oct | 240422765075771 |
9 | 43048520127023 |
10 | 11032023301113 |
11 | 3573722605021 |
12 | 12a20b6347849 |
13 | 620413a31339 |
14 | 2a1d4a5c2cd3 |
15 | 141e7cc49b93 |
hex | a0897d47bf9 |
11032023301113 has 8 divisors (see below), whose sum is σ = 14710638096000. Its totient is φ = 7354045353488.
The previous prime is 11032023301097. The next prime is 11032023301127. The reversal of 11032023301113 is 31110332023011.
It is a happy number.
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 11032023301113 - 24 = 11032023301097 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11032023301113.
It is not an unprimeable number, because it can be changed into a prime (11032023301163) 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, 159171393 + ... + 159240686.
It is an arithmetic number, because the mean of its divisors is an integer number (1838829762000).
Almost surely, 211032023301113 is an apocalyptic number.
It is an amenable number.
11032023301113 is a deficient number, since it is larger than the sum of its proper divisors (3678614794887).
11032023301113 is a wasteful number, since it uses less digits than its factorization.
11032023301113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 318423631.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 11032023301113 its reverse (31110332023011), we get a palindrome (42142355324124).
The spelling of 11032023301113 in words is "eleven trillion, thirty-two billion, twenty-three million, three hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •