Base | Representation |
---|---|
bin | 100011010000100000000110… |
… | …0000100011111000100110011 |
3 | 1111200002020211122000211001221 |
4 | 1012201000030010133010303 |
5 | 311122142144424341034 |
6 | 3015332150142205511 |
7 | 122216145162263452 |
oct | 10641001404370463 |
9 | 1450066748024057 |
10 | 310131201012019 |
11 | 8a8a99a395a792 |
12 | 2a949607883897 |
13 | 104083291c1b5a |
14 | 5682604744b99 |
15 | 25cc356ca0bb4 |
hex | 11a100c11f133 |
310131201012019 has 8 divisors (see below), whose sum is σ = 314400365672432. Its totient is φ = 305862598298880.
The previous prime is 310131201011963. The next prime is 310131201012037. The reversal of 310131201012019 is 910210102131013.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 310131201012019 - 227 = 310131066794291 is a prime.
It is a super-2 number, since 2×3101312010120192 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 310131201011984 and 310131201012002.
It is not an unprimeable number, because it can be changed into a prime (310131201012089) 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, 139375389 + ... + 141583054.
It is an arithmetic number, because the mean of its divisors is an integer number (39300045709054).
Almost surely, 2310131201012019 is an apocalyptic number.
310131201012019 is a deficient number, since it is larger than the sum of its proper divisors (4269164660413).
310131201012019 is a wasteful number, since it uses less digits than its factorization.
310131201012019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 280973637.
The product of its (nonzero) digits is 324, while the sum is 25.
The spelling of 310131201012019 in words is "three hundred ten trillion, one hundred thirty-one billion, two hundred one million, twelve thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •