Base | Representation |
---|---|
bin | 10000001100101011010… |
… | …011011000010011001100 |
3 | 10221102011110100202221001 |
4 | 100030223103120103030 |
5 | 121214133443431340 |
6 | 2211210041350044 |
7 | 143264140433605 |
oct | 20145323302314 |
9 | 3842143322831 |
10 | 1113123030220 |
11 | 39a088a27913 |
12 | 15b892798324 |
13 | 80c757c5206 |
14 | 3bc382dadac |
15 | 1de4cb0629a |
hex | 1032b4d84cc |
1113123030220 has 24 divisors (see below), whose sum is σ = 2341710355824. Its totient is φ = 444458356416.
The previous prime is 1113123030199. The next prime is 1113123030221. The reversal of 1113123030220 is 220303213111.
It is not an unprimeable number, because it can be changed into a prime (1113123030221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49416939 + ... + 49439458.
It is an arithmetic number, because the mean of its divisors is an integer number (97571264826).
Almost surely, 21113123030220 is an apocalyptic number.
1113123030220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113123030220 is an abundant number, since it is smaller than the sum of its proper divisors (1228587325604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113123030220 is a wasteful number, since it uses less digits than its factorization.
1113123030220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98856969 (or 98856967 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1113123030220 its reverse (220303213111), we get a palindrome (1333426243331).
The spelling of 1113123030220 in words is "one trillion, one hundred thirteen billion, one hundred twenty-three million, thirty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •