Base | Representation |
---|---|
bin | 101011101010010001101… |
… | …0001001000011011001111 |
3 | 210020122202101100010201002 |
4 | 1113110203101020123033 |
5 | 1241303323204143111 |
6 | 20432355434410515 |
7 | 1156350654654356 |
oct | 127244321103317 |
9 | 23218671303632 |
10 | 6000661006031 |
11 | 1a0395877902a |
12 | 80ab75290a3b |
13 | 346b24298523 |
14 | 16a60d8d699d |
15 | a615700663b |
hex | 575234486cf |
6000661006031 has 2 divisors, whose sum is σ = 6000661006032. Its totient is φ = 6000661006030.
The previous prime is 6000661006013. The next prime is 6000661006051. The reversal of 6000661006031 is 1306001660006.
Together with previous prime (6000661006013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 6000661006031 - 210 = 6000661005007 is a prime.
It is a super-2 number, since 2×60006610060312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6000661005985 and 6000661006003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6000661006051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3000330503015 + 3000330503016.
It is an arithmetic number, because the mean of its divisors is an integer number (3000330503016).
Almost surely, 26000661006031 is an apocalyptic number.
6000661006031 is a deficient number, since it is larger than the sum of its proper divisors (1).
6000661006031 is an equidigital number, since it uses as much as digits as its factorization.
6000661006031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 29.
Adding to 6000661006031 its reverse (1306001660006), we get a palindrome (7306662666037).
The spelling of 6000661006031 in words is "six trillion, six hundred sixty-one million, six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •