Base | Representation |
---|---|
bin | 1110110100011100111… |
… | …0110010101001000001 |
3 | 220100011101022002000022 |
4 | 3231013032302221001 |
5 | 13132404110131431 |
6 | 312543305303225 |
7 | 24252115254200 |
oct | 3550716625101 |
9 | 810141262008 |
10 | 254598130241 |
11 | 98a7a009594 |
12 | 41414494b15 |
13 | 1b0158a3110 |
14 | c473383237 |
15 | 695183d07b |
hex | 3b473b2a41 |
254598130241 has 48 divisors (see below), whose sum is σ = 329424818688. Its totient is φ = 194830272000.
The previous prime is 254598130219. The next prime is 254598130253. The reversal of 254598130241 is 142031895452.
254598130241 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 254598130241 - 214 = 254598113857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 254598130192 and 254598130201.
It is not an unprimeable number, because it can be changed into a prime (254598130291) 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 47 ways as a sum of consecutive naturals, for example, 55309046 + ... + 55313648.
It is an arithmetic number, because the mean of its divisors is an integer number (6863017056).
Almost surely, 2254598130241 is an apocalyptic number.
It is an amenable number.
254598130241 is a deficient number, since it is larger than the sum of its proper divisors (74826688447).
254598130241 is a wasteful number, since it uses less digits than its factorization.
254598130241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7462 (or 7455 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 44.
The spelling of 254598130241 in words is "two hundred fifty-four billion, five hundred ninety-eight million, one hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •