Base | Representation |
---|---|
bin | 1011110001110010110111… |
… | …0111100001001001100111 |
3 | 1200212000110110011220012101 |
4 | 2330130231313201021213 |
5 | 3144133244024111423 |
6 | 43313105243032531 |
7 | 2504420310102025 |
oct | 274345567411147 |
9 | 50760413156171 |
10 | 12950095925863 |
11 | 41431175a6218 |
12 | 1551994b0b747 |
13 | 72c25ba63975 |
14 | 32ab06345715 |
15 | 176cdd43e7ad |
hex | bc72dde1267 |
12950095925863 has 2 divisors, whose sum is σ = 12950095925864. Its totient is φ = 12950095925862.
The previous prime is 12950095925807. The next prime is 12950095925951. The reversal of 12950095925863 is 36852959005921.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12950095925863 - 217 = 12950095794791 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12950095925795 and 12950095925804.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12950095925363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6475047962931 + 6475047962932.
It is an arithmetic number, because the mean of its divisors is an integer number (6475047962932).
Almost surely, 212950095925863 is an apocalyptic number.
12950095925863 is a deficient number, since it is larger than the sum of its proper divisors (1).
12950095925863 is an equidigital number, since it uses as much as digits as its factorization.
12950095925863 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52488000, while the sum is 64.
The spelling of 12950095925863 in words is "twelve trillion, nine hundred fifty billion, ninety-five million, nine hundred twenty-five thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •