Base | Representation |
---|---|
bin | 101011101010111011011… |
… | …001111001100010101101 |
3 | 101121220012000211210212022 |
4 | 223222323121321202231 |
5 | 343132103003120133 |
6 | 10214353231515525 |
7 | 426550232113304 |
oct | 53527331714255 |
9 | 11556160753768 |
10 | 3001031301293 |
11 | a57803a296a3 |
12 | 405753388ba5 |
13 | 189cc43a945c |
14 | a5371c7143b |
15 | 530e5059998 |
hex | 2babb6798ad |
3001031301293 has 4 divisors (see below), whose sum is σ = 3082140255420. Its totient is φ = 2919922347168.
The previous prime is 3001031301269. The next prime is 3001031301319. The reversal of 3001031301293 is 3921031301003.
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 1556712868489 + 1444318432804 = 1247683^2 + 1201798^2 .
It is a cyclic number.
It is not a de Polignac number, because 3001031301293 - 212 = 3001031297197 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 (3001031901293) 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, 40554477008 + ... + 40554477081.
It is an arithmetic number, because the mean of its divisors is an integer number (770535063855).
Almost surely, 23001031301293 is an apocalyptic number.
It is an amenable number.
3001031301293 is a deficient number, since it is larger than the sum of its proper divisors (81108954127).
3001031301293 is an equidigital number, since it uses as much as digits as its factorization.
3001031301293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81108954126.
The product of its (nonzero) digits is 1458, while the sum is 26.
Adding to 3001031301293 its reverse (3921031301003), we get a palindrome (6922062602296).
The spelling of 3001031301293 in words is "three trillion, one billion, thirty-one million, three hundred one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •