Base | Representation |
---|---|
bin | 1000110110011010001… |
… | …1010111011000110001 |
3 | 112112110020100220111111 |
4 | 2031212203113120301 |
5 | 4442341331332400 |
6 | 153503115113321 |
7 | 13661542044412 |
oct | 2154643273061 |
9 | 475406326444 |
10 | 152044402225 |
11 | 59533112871 |
12 | 25573442841 |
13 | 11450ca2011 |
14 | 75050c7809 |
15 | 3e4d3133ba |
hex | 23668d7631 |
152044402225 has 6 divisors (see below), whose sum is σ = 188535058790. Its totient is φ = 121635521760.
The previous prime is 152044402219. The next prime is 152044402229. The reversal of 152044402225 is 522204440251.
152044402225 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 2312551921 + 149731850304 = 48089^2 + 386952^2 .
It is not a de Polignac number, because 152044402225 - 25 = 152044402193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (152044402229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3040888020 + ... + 3040888069.
Almost surely, 2152044402225 is an apocalyptic number.
It is an amenable number.
152044402225 is a deficient number, since it is larger than the sum of its proper divisors (36490656565).
152044402225 is an equidigital number, since it uses as much as digits as its factorization.
152044402225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6081776099 (or 6081776094 counting only the distinct ones).
The product of its (nonzero) digits is 25600, while the sum is 31.
Adding to 152044402225 its reverse (522204440251), we get a palindrome (674248842476).
The spelling of 152044402225 in words is "one hundred fifty-two billion, forty-four million, four hundred two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •