Base | Representation |
---|---|
bin | 101100101111000010010… |
… | …010100000111101000001 |
3 | 101212212221120202010100021 |
4 | 230233002102200331001 |
5 | 400331340240000423 |
6 | 10312130012253441 |
7 | 435046403324212 |
oct | 54570222407501 |
9 | 11785846663307 |
10 | 3074161250113 |
11 | a85820978628 |
12 | 417962471281 |
13 | 193b7a106715 |
14 | a8b0c439409 |
15 | 54e7532c95d |
hex | 2cbc24a0f41 |
3074161250113 has 4 divisors (see below), whose sum is σ = 3074729177428. Its totient is φ = 3073593322800.
The previous prime is 3074161250023. The next prime is 3074161250123. The reversal of 3074161250113 is 3110521614703.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 570905669889 + 2503255580224 = 755583^2 + 1582168^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3074161250113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3074161250123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 283955538 + ... + 283966363.
It is an arithmetic number, because the mean of its divisors is an integer number (768682294357).
Almost surely, 23074161250113 is an apocalyptic number.
It is an amenable number.
3074161250113 is a deficient number, since it is larger than the sum of its proper divisors (567927315).
3074161250113 is an equidigital number, since it uses as much as digits as its factorization.
3074161250113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 567927314.
The product of its (nonzero) digits is 15120, while the sum is 34.
Adding to 3074161250113 its reverse (3110521614703), we get a palindrome (6184682864816).
The spelling of 3074161250113 in words is "three trillion, seventy-four billion, one hundred sixty-one million, two hundred fifty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •