Base | Representation |
---|---|
bin | 110110111001001101000100… |
… | …100000010100110111111001 |
3 | 1011122211001120002200012010111 |
4 | 312321031010200110313321 |
5 | 223121004014314001444 |
6 | 2213245211434144321 |
7 | 101565264224424625 |
oct | 6671150440246771 |
9 | 1148731502605114 |
10 | 241425556000249 |
11 | 6aa20004457975 |
12 | 230b1a822820a1 |
13 | a493441c2833a |
14 | 43890b8864185 |
15 | 1cda075819234 |
hex | db9344814df9 |
241425556000249 has 2 divisors, whose sum is σ = 241425556000250. Its totient is φ = 241425556000248.
The previous prime is 241425556000177. The next prime is 241425556000259. The reversal of 241425556000249 is 942000655524142.
241425556000249 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 221092959948025 + 20332596052224 = 14869195^2 + 4509168^2 .
It is a cyclic number.
It is not a de Polignac number, because 241425556000249 - 213 = 241425555992057 is a prime.
It is not a weakly prime, because it can be changed into another prime (241425556000259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120712778000124 + 120712778000125.
It is an arithmetic number, because the mean of its divisors is an integer number (120712778000125).
Almost surely, 2241425556000249 is an apocalyptic number.
It is an amenable number.
241425556000249 is a deficient number, since it is larger than the sum of its proper divisors (1).
241425556000249 is an equidigital number, since it uses as much as digits as its factorization.
241425556000249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456000, while the sum is 49.
The spelling of 241425556000249 in words is "two hundred forty-one trillion, four hundred twenty-five billion, five hundred fifty-six million, two hundred forty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •