Base | Representation |
---|---|
bin | 10000001100100101010… |
… | …110111100001000000111 |
3 | 10221101220111200221221000 |
4 | 100030211112330020013 |
5 | 121213432431100403 |
6 | 2211152120024343 |
7 | 143261516644341 |
oct | 20144526741007 |
9 | 3841814627830 |
10 | 1113023300103 |
11 | 39a037700130 |
12 | 15b8653020b3 |
13 | 80c5ac47500 |
14 | 3bc28d7a291 |
15 | 1de43ea67a3 |
hex | 103255bc207 |
1113023300103 has 48 divisors (see below), whose sum is σ = 1947840756480. Its totient is φ = 622670349600.
The previous prime is 1113023300089. The next prime is 1113023300141. The reversal of 1113023300103 is 3010033203111.
It is a happy number.
It is not a de Polignac number, because 1113023300103 - 222 = 1113019105799 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113023310103) 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 47 ways as a sum of consecutive naturals, for example, 11037243 + ... + 11137628.
It is an arithmetic number, because the mean of its divisors is an integer number (40580015760).
Almost surely, 21113023300103 is an apocalyptic number.
1113023300103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1113023300103 is a deficient number, since it is larger than the sum of its proper divisors (834817456377).
1113023300103 is a wasteful number, since it uses less digits than its factorization.
1113023300103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22174917 (or 22174898 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 1113023300103 its reverse (3010033203111), we get a palindrome (4123056503214).
The spelling of 1113023300103 in words is "one trillion, one hundred thirteen billion, twenty-three million, three hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •