Search a number
-
+
495105006001 = 4311514069907
BaseRepresentation
bin1110011010001101000…
…11101101100110110001
31202022221201102020211111
413031012203231212301
531102433340143001
61015240442313321
750525110053664
oct7150643554661
91668851366744
10495105006001
11180a77961011
127bb557b8841
13378c3c96418
1419d6b0976db
15cd2b01e851
hex73468ed9b1

495105006001 has 4 divisors (see below), whose sum is σ = 506619075952. Its totient is φ = 483590936052.

The previous prime is 495105005999. The next prime is 495105006013. The reversal of 495105006001 is 100600501594.

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, and also an emirpimes, since its reverse is a distinct semiprime: 100600501594 = 250300250797.

It is a cyclic number.

It is not a de Polignac number, because 495105006001 - 21 = 495105005999 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (495105006031) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5757034911 + ... + 5757034996.

It is an arithmetic number, because the mean of its divisors is an integer number (126654768988).

Almost surely, 2495105006001 is an apocalyptic number.

It is an amenable number.

495105006001 is a deficient number, since it is larger than the sum of its proper divisors (11514069951).

495105006001 is a wasteful number, since it uses less digits than its factorization.

495105006001 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 11514069950.

The product of its (nonzero) digits is 5400, while the sum is 31.

Adding to 495105006001 its reverse (100600501594), we get a palindrome (595705507595).

The spelling of 495105006001 in words is "four hundred ninety-five billion, one hundred five million, six thousand, one".

Divisors: 1 43 11514069907 495105006001