Base | Representation |
---|---|
bin | 101101001001111011000… |
… | …100110000001000001001 |
3 | 101222122110120201002220002 |
4 | 231021323010300020021 |
5 | 401320001443342420 |
6 | 10333302440212345 |
7 | 440121002161520 |
oct | 55117304601011 |
9 | 11878416632802 |
10 | 3103031230985 |
11 | a96a96263554 |
12 | 42147aa6a0b5 |
13 | 1967cb33a23a |
14 | aa28a76d4b7 |
15 | 55ab4b41075 |
hex | 2d27b130209 |
3103031230985 has 16 divisors (see below), whose sum is σ = 4267641188736. Its totient is φ = 2121765093888.
The previous prime is 3103031230973. The next prime is 3103031230987. The reversal of 3103031230985 is 5890321303013.
It is a cyclic number.
It is not a de Polignac number, because 3103031230985 - 28 = 3103031230729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3103031230987) by changing a digit.
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, 125565599 + ... + 125590308.
It is an arithmetic number, because the mean of its divisors is an integer number (266727574296).
Almost surely, 23103031230985 is an apocalyptic number.
3103031230985 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3103031230985 is a deficient number, since it is larger than the sum of its proper divisors (1164609957751).
3103031230985 is a wasteful number, since it uses less digits than its factorization.
3103031230985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251156272.
The product of its (nonzero) digits is 58320, while the sum is 38.
Adding to 3103031230985 its reverse (5890321303013), we get a palindrome (8993352533998).
The spelling of 3103031230985 in words is "three trillion, one hundred three billion, thirty-one million, two hundred thirty thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •