Base | Representation |
---|---|
bin | 110111111001101100010100… |
… | …1101101010111001101011111 |
3 | 2101111000102121210102110120220 |
4 | 1233303120221231113031133 |
5 | 1003422221414323413023 |
6 | 4501442235344012423 |
7 | 205400121242602563 |
oct | 15763305155271537 |
9 | 2344012553373526 |
10 | 491714325607263 |
11 | 132747968926090 |
12 | 47195644901113 |
13 | 1814a600b75325 |
14 | 895d1594ad6a3 |
15 | 3bca940cc83e3 |
hex | 1bf3629b5735f |
491714325607263 has 16 divisors (see below), whose sum is σ = 715232492726400. Its totient is φ = 298003825736480.
The previous prime is 491714325607249. The next prime is 491714325607291. The reversal of 491714325607263 is 362706523417194.
It is a cyclic number.
It is not a de Polignac number, because 491714325607263 - 222 = 491714321412959 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 491714325607197 and 491714325607206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (491714325607243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 119355048 + ... + 123406061.
It is an arithmetic number, because the mean of its divisors is an integer number (44702030795400).
Almost surely, 2491714325607263 is an apocalyptic number.
491714325607263 is a deficient number, since it is larger than the sum of its proper divisors (223518167119137).
491714325607263 is a wasteful number, since it uses less digits than its factorization.
491714325607263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242822502.
The product of its (nonzero) digits is 45722880, while the sum is 60.
The spelling of 491714325607263 in words is "four hundred ninety-one trillion, seven hundred fourteen billion, three hundred twenty-five million, six hundred seven thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •