Base | Representation |
---|---|
bin | 110011010111001101… |
… | …0010010101011000101 |
3 | 101112201000111022112120 |
4 | 1212232122102223011 |
5 | 3301343334411323 |
6 | 122400554240153 |
7 | 10653226111302 |
oct | 1465632225305 |
9 | 345630438476 |
10 | 110300310213 |
11 | 42861716675 |
12 | 19463426059 |
13 | a52a7a5c62 |
14 | 54a50380a9 |
15 | 2d086685e3 |
hex | 19ae692ac5 |
110300310213 has 16 divisors (see below), whose sum is σ = 151949707776. Its totient is φ = 71096555520.
The previous prime is 110300310209. The next prime is 110300310271. The reversal of 110300310213 is 312013003011.
It is not a de Polignac number, because 110300310213 - 22 = 110300310209 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110300310192 and 110300310201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110300310293) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 438556 + ... + 642597.
It is an arithmetic number, because the mean of its divisors is an integer number (9496856736).
Almost surely, 2110300310213 is an apocalyptic number.
It is an amenable number.
110300310213 is a deficient number, since it is larger than the sum of its proper divisors (41649397563).
110300310213 is a wasteful number, since it uses less digits than its factorization.
110300310213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1082284.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 110300310213 its reverse (312013003011), we get a palindrome (422313313224).
The spelling of 110300310213 in words is "one hundred ten billion, three hundred million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •