Base | Representation |
---|---|
bin | 101101000111010010100… |
… | …011110011000100000011 |
3 | 101222101011112210220111001 |
4 | 231013102203303010003 |
5 | 401243204212114341 |
6 | 10332114123232431 |
7 | 436660642242022 |
oct | 55072243630403 |
9 | 11871145726431 |
10 | 3100204019971 |
11 | a95875390023 |
12 | 420a10078717 |
13 | 19646a6a3606 |
14 | aa09d0a48b9 |
15 | 5599b82dd31 |
hex | 2d1d28f3103 |
3100204019971 has 2 divisors, whose sum is σ = 3100204019972. Its totient is φ = 3100204019970.
The previous prime is 3100204019929. The next prime is 3100204020031. The reversal of 3100204019971 is 1799104020013.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3100204019971 - 29 = 3100204019459 is a prime.
It is a super-2 number, since 2×31002040199712 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3100204019971.
It is not a weakly prime, because it can be changed into another prime (3100204019911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1550102009985 + 1550102009986.
It is an arithmetic number, because the mean of its divisors is an integer number (1550102009986).
Almost surely, 23100204019971 is an apocalyptic number.
3100204019971 is a deficient number, since it is larger than the sum of its proper divisors (1).
3100204019971 is an equidigital number, since it uses as much as digits as its factorization.
3100204019971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 37.
Adding to 3100204019971 its reverse (1799104020013), we get a palindrome (4899308039984).
The spelling of 3100204019971 in words is "three trillion, one hundred billion, two hundred four million, nineteen thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •