Base | Representation |
---|---|
bin | 110011011000001011… |
… | …1000010010001010110 |
3 | 101112210022000200121221 |
4 | 1212300113002101112 |
5 | 3301430222323110 |
6 | 122404123200554 |
7 | 10654104056044 |
oct | 1466027022126 |
9 | 345708020557 |
10 | 110333011030 |
11 | 42879121240 |
12 | 1947237615a |
13 | a5344b5358 |
14 | 54a950b394 |
15 | 2d0b4777da |
hex | 19b05c2456 |
110333011030 has 64 divisors (see below), whose sum is σ = 220011640128. Its totient is φ = 39501250560.
The previous prime is 110333011021. The next prime is 110333011037. The reversal of 110333011030 is 30110333011.
110333011030 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1103330110302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110333010995 and 110333011013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110333011037) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4621404 + ... + 4645216.
It is an arithmetic number, because the mean of its divisors is an integer number (3437681877).
Almost surely, 2110333011030 is an apocalyptic number.
110333011030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110333011030 is a deficient number, since it is larger than the sum of its proper divisors (109678629098).
110333011030 is a wasteful number, since it uses less digits than its factorization.
110333011030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24481.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 110333011030 its reverse (30110333011), we get a palindrome (140443344041).
The spelling of 110333011030 in words is "one hundred ten billion, three hundred thirty-three million, eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •