Base | Representation |
---|---|
bin | 110011010001010001… |
… | …0101111110010001101 |
3 | 101112012010211110200201 |
4 | 1212202202233302031 |
5 | 3300441401400023 |
6 | 122325122453501 |
7 | 10645260521140 |
oct | 1464242576215 |
9 | 345163743621 |
10 | 110101200013 |
11 | 4276a291192 |
12 | 19408804291 |
13 | a4c847097c |
14 | 5486808057 |
15 | 2ce5e37bad |
hex | 19a28afc8d |
110101200013 has 8 divisors (see below), whose sum is σ = 125832295232. Its totient is φ = 94370692896.
The previous prime is 110101200007. The next prime is 110101200101. The reversal of 110101200013 is 310002101011.
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 110101200013 - 225 = 110067645581 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110101200613) 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 7 ways as a sum of consecutive naturals, for example, 380206 + ... + 603952.
It is an arithmetic number, because the mean of its divisors is an integer number (15729036904).
Almost surely, 2110101200013 is an apocalyptic number.
It is an amenable number.
110101200013 is a deficient number, since it is larger than the sum of its proper divisors (15731095219).
110101200013 is an equidigital number, since it uses as much as digits as its factorization.
110101200013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294051.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 110101200013 its reverse (310002101011), we get a palindrome (420103301024).
The spelling of 110101200013 in words is "one hundred ten billion, one hundred one million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •