Search a number
-
+
154050026225 = 5211035586583
BaseRepresentation
bin1000111101111000011…
…0001101101011110001
3112201122000022011101212
42033132012031223301
510010443301314400
6154434122405505
714062334421614
oct2173606155361
9481560264355
10154050026225
115a372250867
1225a33060895
13116b0668194
14765560817b
154019437335
hex23de18daf1

154050026225 has 12 divisors (see below), whose sum is σ = 191195250816. Its totient is φ = 123128267280.

The previous prime is 154050026203. The next prime is 154050026281. The reversal of 154050026225 is 522620050451.

It is not a de Polignac number, because 154050026225 - 216 = 154049960689 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 154050026191 and 154050026200.

It is an unprimeable number.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2765717 + ... + 2820866.

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

Almost surely, 2154050026225 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5587696 (or 5587691 counting only the distinct ones).

The product of its (nonzero) digits is 24000, while the sum is 32.

Adding to 154050026225 its reverse (522620050451), we get a palindrome (676670076676).

The spelling of 154050026225 in words is "one hundred fifty-four billion, fifty million, twenty-six thousand, two hundred twenty-five".

Divisors: 1 5 25 1103 5515 27575 5586583 27932915 139664575 6162001049 30810005245 154050026225