Base | Representation |
---|---|
bin | 1010000001000010101111… |
… | …0011010111100101100110 |
3 | 1102222211120001211202022022 |
4 | 2200100223303113211212 |
5 | 2420414141421030230 |
6 | 35231152215503142 |
7 | 2214444114141614 |
oct | 240205363274546 |
9 | 42884501752268 |
10 | 11013031033190 |
11 | 3566666a0002a |
12 | 129a495987ab2 |
13 | 61b6a8070094 |
14 | 2a106809c6b4 |
15 | 14171a6db1e5 |
hex | a042bcd7966 |
11013031033190 has 8 divisors (see below), whose sum is σ = 19823455859760. Its totient is φ = 4405212413272.
The previous prime is 11013031033189. The next prime is 11013031033201. The reversal of 11013031033190 is 9133013031011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×110130310331902 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
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, 550651551650 + ... + 550651551669.
It is an arithmetic number, because the mean of its divisors is an integer number (2477931982470).
Almost surely, 211013031033190 is an apocalyptic number.
11013031033190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11013031033190 is a deficient number, since it is larger than the sum of its proper divisors (8810424826570).
11013031033190 is a wasteful number, since it uses less digits than its factorization.
11013031033190 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101303103326.
The product of its (nonzero) digits is 729, while the sum is 26.
The spelling of 11013031033190 in words is "eleven trillion, thirteen billion, thirty-one million, thirty-three thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •