Search a number
-
+
10000150521 = 33333383507
BaseRepresentation
bin10010101000000111…
…00010111111111001
3221210221001021121020
421110003202333321
5130440014304041
64332145533053
7502545606534
oct112403427771
927727037536
1010000150521
114271908109
121b31044189
13c34a40b3a
146ac1a1a1b
153d7ddc866
hex2540e2ff9

10000150521 has 4 divisors (see below), whose sum is σ = 13333534032. Its totient is φ = 6666767012.

The previous prime is 10000150507. The next prime is 10000150529. The reversal of 10000150521 is 12505100001.

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 10000150521 - 27 = 10000150393 is a prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 10000150521.

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

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

Almost surely, 210000150521 is an apocalyptic number.

It is an amenable number.

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

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

10000150521 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 3333383510.

The product of its (nonzero) digits is 50, while the sum is 15.

Adding to 10000150521 its reverse (12505100001), we get a palindrome (22505250522).

The spelling of 10000150521 in words is "ten billion, one hundred fifty thousand, five hundred twenty-one".

Divisors: 1 3 3333383507 10000150521