Base | Representation |
---|---|
bin | 10000001100101011001… |
… | …000010000001001000111 |
3 | 10221102011020212120120010 |
4 | 100030223020100021013 |
5 | 121214132222110343 |
6 | 2211205455041303 |
7 | 143264103564336 |
oct | 20145310201107 |
9 | 3842136776503 |
10 | 1113120113223 |
11 | 39a087315278 |
12 | 15b891810233 |
13 | 80c75013591 |
14 | 3bc37b7bd1d |
15 | 1de4c72bd33 |
hex | 1032b210247 |
1113120113223 has 128 divisors (see below), whose sum is σ = 1736996659200. Its totient is φ = 629547835392.
The previous prime is 1113120113213. The next prime is 1113120113233. The reversal of 1113120113223 is 3223110213111.
It is an interprime number because it is at equal distance from previous prime (1113120113213) and next prime (1113120113233).
It is not a de Polignac number, because 1113120113223 - 26 = 1113120113159 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1113120113223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113120113213) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 277791886 + ... + 277795892.
It is an arithmetic number, because the mean of its divisors is an integer number (13570286400).
Almost surely, 21113120113223 is an apocalyptic number.
1113120113223 is a deficient number, since it is larger than the sum of its proper divisors (623876545977).
1113120113223 is a wasteful number, since it uses less digits than its factorization.
1113120113223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4261.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 1113120113223 its reverse (3223110213111), we get a palindrome (4336230326334).
The spelling of 1113120113223 in words is "one trillion, one hundred thirteen billion, one hundred twenty million, one hundred thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •