Base | Representation |
---|---|
bin | 101011101010000101001… |
… | …011101100010001011101 |
3 | 101121210211122002120020202 |
4 | 223222011023230101131 |
5 | 343123222112413021 |
6 | 10214123053553245 |
7 | 426515544621152 |
oct | 53520513542135 |
9 | 11553748076222 |
10 | 3000121607261 |
11 | a57387486049 |
12 | 40553a7a5825 |
13 | 189baaa9a56c |
14 | a52c7110229 |
15 | 53090265a0b |
hex | 2ba852ec45d |
3000121607261 has 8 divisors (see below), whose sum is σ = 3002995563744. Its totient is φ = 2997248158800.
The previous prime is 3000121607239. The next prime is 3000121607269. The reversal of 3000121607261 is 1627061210003.
3000121607261 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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3000121607261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3000121607269) 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, 12266015 + ... + 12508211.
It is an arithmetic number, because the mean of its divisors is an integer number (375374445468).
Almost surely, 23000121607261 is an apocalyptic number.
It is an amenable number.
3000121607261 is a deficient number, since it is larger than the sum of its proper divisors (2873956483).
3000121607261 is a wasteful number, since it uses less digits than its factorization.
3000121607261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 254011.
The product of its (nonzero) digits is 3024, while the sum is 29.
Adding to 3000121607261 its reverse (1627061210003), we get a palindrome (4627182817264).
The spelling of 3000121607261 in words is "three trillion, one hundred twenty-one million, six hundred seven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •