Base | Representation |
---|---|
bin | 110011010111100000… |
… | …0000110110010100101 |
3 | 101112201201010221100022 |
4 | 1212233000012302211 |
5 | 3301403404114023 |
6 | 122401550524525 |
7 | 10653406265504 |
oct | 1465700066245 |
9 | 345651127308 |
10 | 110310223013 |
11 | 42867277271 |
12 | 19466806745 |
13 | a52c866c13 |
14 | 54a649883b |
15 | 2d094757c8 |
hex | 19af006ca5 |
110310223013 has 8 divisors (see below), whose sum is σ = 112449860832. Its totient is φ = 108185091696.
The previous prime is 110310223007. The next prime is 110310223027. The reversal of 110310223013 is 310322013011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110310223013 - 234 = 93130353829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110310222982 and 110310223000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110310223063) 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 7 ways as a sum of consecutive naturals, for example, 3611270 + ... + 3641687.
It is an arithmetic number, because the mean of its divisors is an integer number (14056232604).
Almost surely, 2110310223013 is an apocalyptic number.
It is an amenable number.
110310223013 is a deficient number, since it is larger than the sum of its proper divisors (2139637819).
110310223013 is an equidigital number, since it uses as much as digits as its factorization.
110310223013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7253251.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 110310223013 its reverse (310322013011), we get a palindrome (420632236024).
The spelling of 110310223013 in words is "one hundred ten billion, three hundred ten million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •