Base | Representation |
---|---|
bin | 111000010001101011010001… |
… | …0111110101010010010001001 |
3 | 2101220200112212211102102221201 |
4 | 1300203112202332222102021 |
5 | 1004340223202111213001 |
6 | 4512444421430104201 |
7 | 206160223062524125 |
oct | 16043264276522211 |
9 | 2356615784372851 |
10 | 495010600101001 |
11 | 1337a88a8948066 |
12 | 476284544ab061 |
13 | 183293b771c74a |
14 | 8a348d8808585 |
15 | 3c36565ac7501 |
hex | 1c235a2faa489 |
495010600101001 has 8 divisors (see below), whose sum is σ = 500974994207520. Its totient is φ = 489046215779712.
The previous prime is 495010600100971. The next prime is 495010600101011. The reversal of 495010600101001 is 100101006010594.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 495010600101001 - 211 = 495010600098953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (495010600101011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 189939321 + ... + 192527833.
It is an arithmetic number, because the mean of its divisors is an integer number (62621874275940).
Almost surely, 2495010600101001 is an apocalyptic number.
It is an amenable number.
495010600101001 is a deficient number, since it is larger than the sum of its proper divisors (5964394106519).
495010600101001 is a wasteful number, since it uses less digits than its factorization.
495010600101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4892615.
The product of its (nonzero) digits is 1080, while the sum is 28.
Adding to 495010600101001 its reverse (100101006010594), we get a palindrome (595111606111595).
The spelling of 495010600101001 in words is "four hundred ninety-five trillion, ten billion, six hundred million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •