Base | Representation |
---|---|
bin | 110011010111100010… |
… | …0010011010111111010 |
3 | 101112201210012211102101 |
4 | 1212233010103113322 |
5 | 3301404144320010 |
6 | 122402030254014 |
7 | 10653421530031 |
oct | 1465704232772 |
9 | 345653184371 |
10 | 110311323130 |
11 | 42867958858 |
12 | 1946705730a |
13 | a52cb60888 |
14 | 54a66a3718 |
15 | 2d095e173a |
hex | 19af1135fa |
110311323130 has 8 divisors (see below), whose sum is σ = 198560381652. Its totient is φ = 44124529248.
The previous prime is 110311323113. The next prime is 110311323131. The reversal of 110311323130 is 31323113011.
It can be written as a sum of positive squares in 2 ways, for example, as 107545299481 + 2766023649 = 327941^2 + 52593^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 110311323098 and 110311323107.
It is not an unprimeable number, because it can be changed into a prime (110311323131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5515566147 + ... + 5515566166.
Almost surely, 2110311323130 is an apocalyptic number.
110311323130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110311323130 is a deficient number, since it is larger than the sum of its proper divisors (88249058522).
110311323130 is a wasteful number, since it uses less digits than its factorization.
110311323130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11031132320.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 110311323130 its reverse (31323113011), we get a palindrome (141634436141).
It can be divided in two parts, 11031 and 1323130, that added together give a triangular number (1334161 = T1633).
The spelling of 110311323130 in words is "one hundred ten billion, three hundred eleven million, three hundred twenty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •