Base | Representation |
---|---|
bin | 11001000101000110000001… |
… | …010001101000010101111101 |
3 | 112110112200201221200000110212 |
4 | 121011012001101220111331 |
5 | 103424133401321324013 |
6 | 1030331403251442205 |
7 | 32143000104413621 |
oct | 3105060121502575 |
9 | 473480657600425 |
10 | 110301224011133 |
11 | 32166539453141 |
12 | 104551488b6365 |
13 | 497148c8805bc |
14 | 1d34871863181 |
15 | cb42c45a16a8 |
hex | 64518146857d |
110301224011133 has 32 divisors (see below), whose sum is σ = 111928159639296. Its totient is φ = 108686748008448.
The previous prime is 110301224011093. The next prime is 110301224011189. The reversal of 110301224011133 is 331110422103011.
It is a cyclic number.
It is not a de Polignac number, because 110301224011133 - 246 = 39932479833469 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110301224011099 and 110301224011108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110301224013133) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46996685666 + ... + 46996688012.
It is an arithmetic number, because the mean of its divisors is an integer number (3497754988728).
Almost surely, 2110301224011133 is an apocalyptic number.
It is an amenable number.
110301224011133 is a deficient number, since it is larger than the sum of its proper divisors (1626935628163).
110301224011133 is a wasteful number, since it uses less digits than its factorization.
110301224011133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5253.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 110301224011133 its reverse (331110422103011), we get a palindrome (441411646114144).
The spelling of 110301224011133 in words is "one hundred ten trillion, three hundred one billion, two hundred twenty-four million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •