Base | Representation |
---|---|
bin | 100001100100101000111… |
… | …111100110000100111101 |
3 | 22011112222201211012200012 |
4 | 201210220333212010331 |
5 | 300244402302311004 |
6 | 4523505454313005 |
7 | 325452502421312 |
oct | 41445077460475 |
9 | 8145881735605 |
10 | 2307085197629 |
11 | 80a47a4a2a13 |
12 | 3131661b8765 |
13 | 139732228cc4 |
14 | 7d9409a8d09 |
15 | 4002c6d446e |
hex | 21928fe613d |
2307085197629 has 4 divisors (see below), whose sum is σ = 2307352632384. Its totient is φ = 2306817762876.
The previous prime is 2307085197607. The next prime is 2307085197671. The reversal of 2307085197629 is 9267915807032.
2307085197629 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2307085197629 - 236 = 2238365720893 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 (2307085197229) 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, 133704437 + ... + 133721690.
It is an arithmetic number, because the mean of its divisors is an integer number (576838158096).
Almost surely, 22307085197629 is an apocalyptic number.
It is an amenable number.
2307085197629 is a deficient number, since it is larger than the sum of its proper divisors (267434755).
2307085197629 is an equidigital number, since it uses as much as digits as its factorization.
2307085197629 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267434754.
The product of its (nonzero) digits is 11430720, while the sum is 59.
The spelling of 2307085197629 in words is "two trillion, three hundred seven billion, eighty-five million, one hundred ninety-seven thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •