Base | Representation |
---|---|
bin | 100001100110111110011… |
… | …111101111010100110101 |
3 | 22011210110112111120200112 |
4 | 201212332133233110311 |
5 | 300320021404214201 |
6 | 4525002414352405 |
7 | 325601610143144 |
oct | 41467637572465 |
9 | 8153415446615 |
10 | 2309593429301 |
11 | 810547309554 |
12 | 3137461bb705 |
13 | 139a41a7b162 |
14 | 7dadbb5d75b |
15 | 401279d90bb |
hex | 219be7ef535 |
2309593429301 has 2 divisors, whose sum is σ = 2309593429302. Its totient is φ = 2309593429300.
The previous prime is 2309593429267. The next prime is 2309593429303. The reversal of 2309593429301 is 1039243959032.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2307816722500 + 1776706801 = 1519150^2 + 42151^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2309593429301 is a prime.
Together with 2309593429303, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2309593429301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2309593429303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1154796714650 + 1154796714651.
It is an arithmetic number, because the mean of its divisors is an integer number (1154796714651).
Almost surely, 22309593429301 is an apocalyptic number.
It is an amenable number.
2309593429301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2309593429301 is an equidigital number, since it uses as much as digits as its factorization.
2309593429301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1574640, while the sum is 50.
The spelling of 2309593429301 in words is "two trillion, three hundred nine billion, five hundred ninety-three million, four hundred twenty-nine thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •