Base | Representation |
---|---|
bin | 1110110011000011100… |
… | …1110001000111100001 |
3 | 220022012021101220200021 |
4 | 3230300321301013201 |
5 | 13131122210121400 |
6 | 312442204153441 |
7 | 24236616160543 |
oct | 3546071610741 |
9 | 808167356607 |
10 | 254223520225 |
11 | 988a7605534 |
12 | 4132ab38881 |
13 | 1ac860b139c |
14 | c43970b693 |
15 | 692d9e271a |
hex | 3b30e711e1 |
254223520225 has 24 divisors (see below), whose sum is σ = 331979912640. Its totient is φ = 192586806720.
The previous prime is 254223520219. The next prime is 254223520237. The reversal of 254223520225 is 522025322452.
254223520225 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 254223520225 - 23 = 254223520217 is a prime.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 930252 + ... + 1172098.
It is an arithmetic number, because the mean of its divisors is an integer number (13832496360).
Almost surely, 2254223520225 is an apocalyptic number.
254223520225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
254223520225 is a deficient number, since it is larger than the sum of its proper divisors (77756392415).
254223520225 is a wasteful number, since it uses less digits than its factorization.
254223520225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 244089 (or 244084 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 34.
Adding to 254223520225 its reverse (522025322452), we get a palindrome (776248842677).
The spelling of 254223520225 in words is "two hundred fifty-four billion, two hundred twenty-three million, five hundred twenty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •