Base | Representation |
---|---|
bin | 1000011100010100001… |
… | …1111000100000110001 |
3 | 111212101002102221220001 |
4 | 2013011003320200301 |
5 | 4334020223101400 |
6 | 150344103350001 |
7 | 13323141041200 |
oct | 2070503704061 |
9 | 455332387801 |
10 | 145040050225 |
11 | 56569366504 |
12 | 24139752301 |
13 | 108a5b04235 |
14 | 703cb57237 |
15 | 3b8d439a6a |
hex | 21c50f8831 |
145040050225 has 36 divisors (see below), whose sum is σ = 209275146828. Its totient is φ = 99426432000.
The previous prime is 145040050193. The next prime is 145040050249. The reversal of 145040050225 is 522050040541.
It can be written as a sum of positive squares in 6 ways, for example, as 26081281009 + 118958769216 = 161497^2 + 344904^2 .
It is not a de Polignac number, because 145040050225 - 25 = 145040050193 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145040050193 and 145040050202.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 4591485 + ... + 4622965.
It is an arithmetic number, because the mean of its divisors is an integer number (5813198523).
Almost surely, 2145040050225 is an apocalyptic number.
It is an amenable number.
145040050225 is a deficient number, since it is larger than the sum of its proper divisors (64235096603).
145040050225 is a wasteful number, since it uses less digits than its factorization.
145040050225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35266 (or 35254 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 28.
Adding to 145040050225 its reverse (522050040541), we get a palindrome (667090090766).
It can be divided in two parts, 1450400 and 50225, that added together give a 4-th power (1500625 = 354).
The spelling of 145040050225 in words is "one hundred forty-five billion, forty million, fifty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •