Base | Representation |
---|---|
bin | 110011010101101111… |
… | …1011111010011100111 |
3 | 101112120121100102110011 |
4 | 1212223133133103213 |
5 | 3301243320403111 |
6 | 122352044511051 |
7 | 10652062636066 |
oct | 1465337372347 |
9 | 345517312404 |
10 | 110251341031 |
11 | 4283700a377 |
12 | 1944ab4b487 |
13 | a5205bbb00 |
14 | 549c72c1dd |
15 | 2d041e4021 |
hex | 19ab7df4e7 |
110251341031 has 12 divisors (see below), whose sum is σ = 119395707480. Its totient is φ = 101760990240.
The previous prime is 110251340989. The next prime is 110251341043. The reversal of 110251341031 is 130143152011.
It is a happy number.
It is not a de Polignac number, because 110251341031 - 215 = 110251308263 is a prime.
It is a super-3 number, since 3×1102513410313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110251340993 and 110251341011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110251341061) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2330925 + ... + 2377753.
It is an arithmetic number, because the mean of its divisors is an integer number (9949642290).
Almost surely, 2110251341031 is an apocalyptic number.
110251341031 is a deficient number, since it is larger than the sum of its proper divisors (9144366449).
110251341031 is a wasteful number, since it uses less digits than its factorization.
110251341031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60786 (or 60773 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 110251341031 its reverse (130143152011), we get a palindrome (240394493042).
The spelling of 110251341031 in words is "one hundred ten billion, two hundred fifty-one million, three hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •