Base | Representation |
---|---|
bin | 110011010111100101… |
… | …1001010100101010010 |
3 | 101112201220121020012000 |
4 | 1212233023022211102 |
5 | 3301410124402010 |
6 | 122402133014430 |
7 | 10653443031651 |
oct | 1465713124522 |
9 | 345656536160 |
10 | 110313122130 |
11 | 42868977432 |
12 | 19467784416 |
13 | a530340683 |
14 | 54a6a11198 |
15 | 2d098497c0 |
hex | 19af2ca952 |
110313122130 has 64 divisors (see below), whose sum is σ = 297080956800. Its totient is φ = 29125569600.
The previous prime is 110313122099. The next prime is 110313122149. The reversal of 110313122130 is 31221313011.
110313122130 is a `hidden beast` number, since 110 + 31 + 312 + 213 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1995340 + ... + 2049879.
It is an arithmetic number, because the mean of its divisors is an integer number (4641889950).
Almost surely, 2110313122130 is an apocalyptic number.
110313122130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110313122130 is an abundant number, since it is smaller than the sum of its proper divisors (186767834670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110313122130 is a wasteful number, since it uses less digits than its factorization.
110313122130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4045336 (or 4045330 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 110313122130 its reverse (31221313011), we get a palindrome (141534435141).
The spelling of 110313122130 in words is "one hundred ten billion, three hundred thirteen million, one hundred twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •