Base | Representation |
---|---|
bin | 101101010000100001000… |
… | …000100110111111001000 |
3 | 102000022201220220102221112 |
4 | 231100201000212333020 |
5 | 401424001143130440 |
6 | 10340433113425452 |
7 | 440461266630440 |
oct | 55204100467710 |
9 | 12008656812845 |
10 | 3110110130120 |
11 | a99a990a7214 |
12 | 42291570b288 |
13 | 197388aa9456 |
14 | aa75c987120 |
15 | 55d7b342965 |
hex | 2d421026fc8 |
3110110130120 has 64 divisors (see below), whose sum is σ = 8167584084480. Its totient is φ = 1043635735296.
The previous prime is 3110110130089. The next prime is 3110110130143. The reversal of 3110110130120 is 210310110113.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 3110110130095 and 3110110130104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 118152119 + ... + 118178438.
It is an arithmetic number, because the mean of its divisors is an integer number (127618501320).
Almost surely, 23110110130120 is an apocalyptic number.
It is an amenable number.
3110110130120 is an abundant number, since it is smaller than the sum of its proper divisors (5057473954360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3110110130120 is a wasteful number, since it uses less digits than its factorization.
3110110130120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236330622 (or 236330618 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 3110110130120 its reverse (210310110113), we get a palindrome (3320420240233).
The spelling of 3110110130120 in words is "three trillion, one hundred ten billion, one hundred ten million, one hundred thirty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •