Base | Representation |
---|---|
bin | 101100110110000100011… |
… | …000010101111100111001 |
3 | 101220121102211210122021010 |
4 | 230312010120111330321 |
5 | 400442321401300423 |
6 | 10315415202304133 |
7 | 435434465155215 |
oct | 54660430257471 |
9 | 11817384718233 |
10 | 3081712525113 |
11 | a88a46420272 |
12 | 41930b358049 |
13 | 1947b16a8291 |
14 | a9227297945 |
15 | 5526823c693 |
hex | 2cd84615f39 |
3081712525113 has 8 divisors (see below), whose sum is σ = 4109030137888. Its totient is φ = 2054434964544.
The previous prime is 3081712525097. The next prime is 3081712525123. The reversal of 3081712525113 is 3115252171803.
It is a happy number.
3081712525113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3081712525113 - 24 = 3081712525097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3081712525123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9833056 + ... + 10141617.
It is an arithmetic number, because the mean of its divisors is an integer number (513628767236).
Almost surely, 23081712525113 is an apocalyptic number.
It is an amenable number.
3081712525113 is a deficient number, since it is larger than the sum of its proper divisors (1027317612775).
3081712525113 is a wasteful number, since it uses less digits than its factorization.
3081712525113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20026103.
The product of its (nonzero) digits is 50400, while the sum is 39.
Adding to 3081712525113 its reverse (3115252171803), we get a palindrome (6196964696916).
The spelling of 3081712525113 in words is "three trillion, eighty-one billion, seven hundred twelve million, five hundred twenty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •