Search a number
-
+
1520105001 = 34133122599
BaseRepresentation
bin101101010011010…
…1111011000101001
310220221100100001020
41122212233120221
511103121330001
6410501043053
752445452002
oct13246573051
93827310036
101520105001
11710072428
123650b6489
131b2c1141c
14105c581a9
158d6bb736
hex5a9af629

1520105001 has 8 divisors (see below), whose sum is σ = 2027313600. Its totient is φ = 1013149872.

The previous prime is 1520104991. The next prime is 1520105039. The reversal of 1520105001 is 1005010251.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1520105001 - 29 = 1520104489 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48901 + ... + 73698.

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

Almost surely, 21520105001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 126735.

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

The square root of 1520105001 is about 38988.5239653927. The cubic root of 1520105001 is about 1149.8058906154.

Adding to 1520105001 its reverse (1005010251), we get a palindrome (2525115252).

The spelling of 1520105001 in words is "one billion, five hundred twenty million, one hundred five thousand, one".

Divisors: 1 3 4133 12399 122599 367797 506701667 1520105001