Search a number
-
+
1000000050601 = 1454368761607
BaseRepresentation
bin11101000110101001010…
…01011101010110101001
310112121011201111222220011
432203110221131112221
5112341000003104401
62043221011331521
7132150635116366
oct16432451352651
93477151458804
101000000050601
11356108a5aa12
12141981bb0ba1
13733b82b5896
143658645b46d
151b02b776451
hexe8d4a5d5a9

1000000050601 has 4 divisors (see below), whose sum is σ = 1000068826752. Its totient is φ = 999931274452.

The previous prime is 1000000050509. The next prime is 1000000050607. The reversal of 1000000050601 is 1060500000001.

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 1000000050601 - 29 = 1000000050089 is a prime.

It is a super-2 number, since 2×10000000506012 (a number of 25 digits) contains 22 as substring.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1000000050607) 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, 34366261 + ... + 34395346.

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

Almost surely, 21000000050601 is an apocalyptic number.

It is an amenable number.

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

1000000050601 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 68776150.

The product of its (nonzero) digits is 30, while the sum is 13.

Adding to 1000000050601 its reverse (1060500000001), we get a palindrome (2060500050602).

The spelling of 1000000050601 in words is "one trillion, fifty thousand, six hundred one".

Divisors: 1 14543 68761607 1000000050601