Base | Representation |
---|---|
bin | 100011010000011111100110… |
… | …0010011111100000101111101 |
3 | 1111200002011002002012220010221 |
4 | 1012200333030103330011331 |
5 | 311122133002104234323 |
6 | 3015331452051101341 |
7 | 122216106523124410 |
oct | 10640771423740575 |
9 | 1450064062186127 |
10 | 310130131321213 |
11 | 8a8a94a50671a5 |
12 | 2a9493695a1851 |
13 | 104081b86c3b08 |
14 | 5682542655b77 |
15 | 25cc2e2e0555d |
hex | 11a0fcc4fc17d |
310130131321213 has 8 divisors (see below), whose sum is σ = 361121877980928. Its totient is φ = 260810245207824.
The previous prime is 310130131321141. The next prime is 310130131321217. The reversal of 310130131321213 is 312123131031013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-310130131321213 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 (310130131321217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 417965136181 + ... + 417965136922.
It is an arithmetic number, because the mean of its divisors is an integer number (45140234747616).
Almost surely, 2310130131321213 is an apocalyptic number.
It is an amenable number.
310130131321213 is a deficient number, since it is larger than the sum of its proper divisors (50991746659715).
310130131321213 is an equidigital number, since it uses as much as digits as its factorization.
310130131321213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 835930273163.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 310130131321213 its reverse (312123131031013), we get a palindrome (622253262352226).
The spelling of 310130131321213 in words is "three hundred ten trillion, one hundred thirty billion, one hundred thirty-one million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •