Base | Representation |
---|---|
bin | 111010000100001110001… |
… | …101110101100000100011 |
3 | 112010110120022001020220002 |
4 | 322010032031311200203 |
5 | 1010334024330013201 |
6 | 12253033535010215 |
7 | 561200303642366 |
oct | 72041615654043 |
9 | 15113508036802 |
10 | 3990263126051 |
11 | 12a9296566104 |
12 | 54540b06996b |
13 | 22c384798367 |
14 | db1b61120dd |
15 | 6dbe127576b |
hex | 3a10e375823 |
3990263126051 has 2 divisors, whose sum is σ = 3990263126052. Its totient is φ = 3990263126050.
The previous prime is 3990263126023. The next prime is 3990263126077. The reversal of 3990263126051 is 1506213620993.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3990263126051 - 214 = 3990263109667 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3990263125987 and 3990263126005.
It is not a weakly prime, because it can be changed into another prime (3990263126081) 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, 1995131563025 + 1995131563026.
It is an arithmetic number, because the mean of its divisors is an integer number (1995131563026).
Almost surely, 23990263126051 is an apocalyptic number.
3990263126051 is a deficient number, since it is larger than the sum of its proper divisors (1).
3990263126051 is an equidigital number, since it uses as much as digits as its factorization.
3990263126051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 524880, while the sum is 47.
The spelling of 3990263126051 in words is "three trillion, nine hundred ninety billion, two hundred sixty-three million, one hundred twenty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •