Base | Representation |
---|---|
bin | 1010000001100111111011… |
… | …0001111110001000100110 |
3 | 1110000210022201212210212022 |
4 | 2200121332301332020212 |
5 | 2421100112324012220 |
6 | 35235522522223142 |
7 | 2215246353325355 |
oct | 240317661761046 |
9 | 43023281783768 |
10 | 11023013110310 |
11 | 356a919593343 |
12 | 12a0400954ab2 |
13 | 61c6091236a6 |
14 | 2a1733ab799c |
15 | 141b01c08925 |
hex | a067ec7e226 |
11023013110310 has 8 divisors (see below), whose sum is σ = 19841423598576. Its totient is φ = 4409205244120.
The previous prime is 11023013110247. The next prime is 11023013110327. The reversal of 11023013110310 is 1301131032011.
11023013110310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×110230131103102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 551150655506 + ... + 551150655525.
It is an arithmetic number, because the mean of its divisors is an integer number (2480177949822).
Almost surely, 211023013110310 is an apocalyptic number.
11023013110310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11023013110310 is a deficient number, since it is larger than the sum of its proper divisors (8818410488266).
11023013110310 is a wasteful number, since it uses less digits than its factorization.
11023013110310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1102301311038.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 11023013110310 its reverse (1301131032011), we get a palindrome (12324144142321).
The spelling of 11023013110310 in words is "eleven trillion, twenty-three billion, thirteen million, one hundred ten thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •