Base | Representation |
---|---|
bin | 110011010111100001… |
… | …1100101000001110110 |
3 | 101112201202212012000201 |
4 | 1212233003211001312 |
5 | 3301404122231202 |
6 | 122402022231114 |
7 | 10653420106426 |
oct | 1465703450166 |
9 | 345652765021 |
10 | 110311133302 |
11 | 42867839177 |
12 | 19466b8549a |
13 | a52cac5356 |
14 | 54a6654486 |
15 | 2d095a5387 |
hex | 19af0e5076 |
110311133302 has 8 divisors (see below), whose sum is σ = 165503838456. Its totient is φ = 55143187152.
The previous prime is 110311133291. The next prime is 110311133323. The reversal of 110311133302 is 203331113011.
110311133302 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1103111333022 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110311133302.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6178608 + ... + 6196435.
It is an arithmetic number, because the mean of its divisors is an integer number (20687979807).
Almost surely, 2110311133302 is an apocalyptic number.
110311133302 is a deficient number, since it is larger than the sum of its proper divisors (55192705154).
110311133302 is a wasteful number, since it uses less digits than its factorization.
110311133302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12379502.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 110311133302 its reverse (203331113011), we get a palindrome (313642246313).
The spelling of 110311133302 in words is "one hundred ten billion, three hundred eleven million, one hundred thirty-three thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •