Base | Representation |
---|---|
bin | 101011101100010101111… |
… | …1100000000011000111001 |
3 | 210021002012211210001201021 |
4 | 1113120223330000120321 |
5 | 1241341421431232304 |
6 | 20434412220222441 |
7 | 1156566003645661 |
oct | 127305374003071 |
9 | 23232184701637 |
10 | 6005101430329 |
11 | 1a05827228581 |
12 | 80b9b439aa21 |
13 | 347381213221 |
14 | 16a9115351a1 |
15 | a6316c77a54 |
hex | 5762bf00639 |
6005101430329 has 2 divisors, whose sum is σ = 6005101430330. Its totient is φ = 6005101430328.
The previous prime is 6005101430327. The next prime is 6005101430381. The reversal of 6005101430329 is 9230341015006.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4578414516729 + 1426686913600 = 2139723^2 + 1194440^2 .
It is a cyclic number.
It is not a de Polignac number, because 6005101430329 - 21 = 6005101430327 is a prime.
It is a super-2 number, since 2×60051014303292 (a number of 26 digits) contains 22 as substring.
Together with 6005101430327, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 6005101430294 and 6005101430303.
It is not a weakly prime, because it can be changed into another prime (6005101430327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3002550715164 + 3002550715165.
It is an arithmetic number, because the mean of its divisors is an integer number (3002550715165).
Almost surely, 26005101430329 is an apocalyptic number.
It is an amenable number.
6005101430329 is a deficient number, since it is larger than the sum of its proper divisors (1).
6005101430329 is an equidigital number, since it uses as much as digits as its factorization.
6005101430329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 34.
The spelling of 6005101430329 in words is "six trillion, five billion, one hundred one million, four hundred thirty thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •