Base | Representation |
---|---|
bin | 11101000110110110110… |
… | …01100101111100110100 |
3 | 10112121110121200021210021 |
4 | 32203123121211330310 |
5 | 112341213003111040 |
6 | 2043240135334524 |
7 | 132153512026045 |
oct | 16433331457464 |
9 | 3477417607707 |
10 | 1000113332020 |
11 | 3561669a2a20 |
12 | 1419b3b21444 |
13 | 734058c96ca |
14 | 365975088cc |
15 | 1b0366a124a |
hex | e8db665f34 |
1000113332020 has 48 divisors (see below), whose sum is σ = 2293769814336. Its totient is φ = 363264704000.
The previous prime is 1000113332003. The next prime is 1000113332111. The reversal of 1000113332020 is 202333110001.
It is a junction number, because it is equal to n+sod(n) for n = 1000113331985 and 1000113332003.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2386186 + ... + 2773825.
It is an arithmetic number, because the mean of its divisors is an integer number (47786871132).
Almost surely, 21000113332020 is an apocalyptic number.
1000113332020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1000113332020 is an abundant number, since it is smaller than the sum of its proper divisors (1293656482316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000113332020 is a wasteful number, since it uses less digits than its factorization.
1000113332020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5160912 (or 5160910 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1000113332020 its reverse (202333110001), we get a palindrome (1202446442021).
The spelling of 1000113332020 in words is "one trillion, one hundred thirteen million, three hundred thirty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •