Search a number
-
+
1005551520121 = 2958515926199
BaseRepresentation
bin11101010000111111000…
…10101000100101111001
310120010111121120212102101
432220133202220211321
5112433332142120441
62045535522503401
7132435334615621
oct16503742504571
93503447525371
101005551520121
113584a7689155
12142a71204b61
1373a9147a7a5
1436951871881
151b253d11231
hexea1f8a8979

1005551520121 has 8 divisors (see below), whose sum is σ = 1040403672000. Its totient is φ = 970711232400.

The previous prime is 1005551520101. The next prime is 1005551520167. The reversal of 1005551520121 is 1210251555001.

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

It is a cyclic number.

It is not a de Polignac number, because 1005551520121 - 27 = 1005551519993 is a prime.

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

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 1005551520121.

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

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

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

Almost surely, 21005551520121 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5932079.

The product of its (nonzero) digits is 2500, while the sum is 28.

The spelling of 1005551520121 in words is "one trillion, five billion, five hundred fifty-one million, five hundred twenty thousand, one hundred twenty-one".

Divisors: 1 29 5851 169679 5926199 171859771 34674190349 1005551520121