Base | Representation |
---|---|
bin | 1110101100101001011… |
… | …01011001001111111001 |
3 | 1210021111202002000111002 |
4 | 13112110231121033321 |
5 | 31233223030221442 |
6 | 1023555133214345 |
7 | 51325344015422 |
oct | 7262455311771 |
9 | 1707452060432 |
10 | 505006101497 |
11 | 185198862667 |
12 | 81a596313b5 |
13 | 38811334901 |
14 | 1a62a032649 |
15 | d20a392732 |
hex | 7594b593f9 |
505006101497 has 4 divisors (see below), whose sum is σ = 507543820800. Its totient is φ = 502468382196.
The previous prime is 505006101407. The next prime is 505006101499. The reversal of 505006101497 is 794101600505.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 505006101497 - 214 = 505006085113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 505006101497.
It is not an unprimeable number, because it can be changed into a prime (505006101499) 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 3 ways as a sum of consecutive naturals, for example, 1268859353 + ... + 1268859750.
It is an arithmetic number, because the mean of its divisors is an integer number (126885955200).
Almost surely, 2505006101497 is an apocalyptic number.
It is an amenable number.
505006101497 is a deficient number, since it is larger than the sum of its proper divisors (2537719303).
505006101497 is a wasteful number, since it uses less digits than its factorization.
505006101497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2537719302.
The product of its (nonzero) digits is 37800, while the sum is 38.
The spelling of 505006101497 in words is "five hundred five billion, six million, one hundred one thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •