Search a number
-
+
15325120022010 = 235510837334067
BaseRepresentation
bin1101111100000010100001…
…0101011100010111111010
32000021001210222000202001020
43133000220111130113322
54002041321211201020
652332132444003310
73141126521605641
oct337005025342772
960231728022036
1015325120022010
11497938a800147
12187613b830536
138721ca3b8826
143ada4dcc4358
151b8995302c40
hexdf02855c5fa

15325120022010 has 16 divisors (see below), whose sum is σ = 36780288052896. Its totient is φ = 4086698672528.

The previous prime is 15325120021961. The next prime is 15325120022057. The reversal of 15325120022010 is 1022002152351.

It is an unprimeable number.

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

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

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

Almost surely, 215325120022010 is an apocalyptic number.

15325120022010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

15325120022010 is an abundant number, since it is smaller than the sum of its proper divisors (21455168030886).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 510837334077.

The product of its (nonzero) digits is 1200, while the sum is 24.

Adding to 15325120022010 its reverse (1022002152351), we get a palindrome (16347122174361).

The spelling of 15325120022010 in words is "fifteen trillion, three hundred twenty-five billion, one hundred twenty million, twenty-two thousand, ten".

Divisors: 1 2 3 5 6 10 15 30 510837334067 1021674668134 1532512002201 2554186670335 3065024004402 5108373340670 7662560011005 15325120022010