Base | Representation |
---|---|
bin | 100011010001001001111011… |
… | …0111001011111100010011101 |
3 | 1111200101211201200011110121011 |
4 | 1012202103312321133202131 |
5 | 311130130142232401023 |
6 | 3015441324534135221 |
7 | 122225505366153106 |
oct | 10642236671374235 |
9 | 1450354650143534 |
10 | 310221040122013 |
11 | 8a934005780829 |
12 | 2a962aba7b1511 |
13 | 104139458a1537 |
14 | 5686ac81213ad |
15 | 25ce863e4b50d |
hex | 11a24f6e5f89d |
310221040122013 has 4 divisors (see below), whose sum is σ = 310221716195260. Its totient is φ = 310220364048768.
The previous prime is 310221040122011. The next prime is 310221040122031.
310221040122013 is nontrivially palindromic in base 10.
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 198717007276804 + 111504032845209 = 14096702^2 + 10559547^2 .
It is a cyclic number.
It is not a de Polignac number, because 310221040122013 - 21 = 310221040122011 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 (310221040122011) 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, 337347870 + ... + 338266207.
It is an arithmetic number, because the mean of its divisors is an integer number (77555429048815).
Almost surely, 2310221040122013 is an apocalyptic number.
It is an amenable number.
310221040122013 is a deficient number, since it is larger than the sum of its proper divisors (676073247).
310221040122013 is an equidigital number, since it uses as much as digits as its factorization.
310221040122013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 676073246.
The product of its (nonzero) digits is 576, while the sum is 22.
The spelling of 310221040122013 in words is "three hundred ten trillion, two hundred twenty-one billion, forty million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •