Base | Representation |
---|---|
bin | 101101100011010001001… |
… | …110001010111010011111 |
3 | 102002020201020202002222210 |
4 | 231203101032022322133 |
5 | 402241221031004401 |
6 | 10354003150411503 |
7 | 442103264626410 |
oct | 55432116127237 |
9 | 12066636662883 |
10 | 3130246344351 |
11 | aa7591501a85 |
12 | 4267b5200b93 |
13 | 199247767209 |
14 | ab70cda9807 |
15 | 566590184d6 |
hex | 2d8d138ae9f |
3130246344351 has 32 divisors (see below), whose sum is σ = 5121615080448. Its totient is φ = 1659782638080.
The previous prime is 3130246344341. The next prime is 3130246344361. The reversal of 3130246344351 is 1534436420313.
It is an interprime number because it is at equal distance from previous prime (3130246344341) and next prime (3130246344361).
It is not a de Polignac number, because 3130246344351 - 218 = 3130246082207 is a prime.
It is a super-2 number, since 2×31302463443512 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3130246344311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61722520 + ... + 61773213.
It is an arithmetic number, because the mean of its divisors is an integer number (160050471264).
Almost surely, 23130246344351 is an apocalyptic number.
3130246344351 is a deficient number, since it is larger than the sum of its proper divisors (1991368736097).
3130246344351 is a wasteful number, since it uses less digits than its factorization.
3130246344351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123495831.
The product of its (nonzero) digits is 311040, while the sum is 39.
The spelling of 3130246344351 in words is "three trillion, one hundred thirty billion, two hundred forty-six million, three hundred forty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •