Base | Representation |
---|---|
bin | 1110110011110010111… |
… | …1010010100110000000 |
3 | 220022201010001211101210 |
4 | 3230330233102212000 |
5 | 13132024024202402 |
6 | 312514020330120 |
7 | 24244550112420 |
oct | 3547457224600 |
9 | 808633054353 |
10 | 254422100352 |
11 | 98999708742 |
12 | 41385543940 |
13 | 1acb828c314 |
14 | c457c40480 |
15 | 694116b06c |
hex | 3b3cbd2980 |
254422100352 has 64 divisors (see below), whose sum is σ = 772352812800. Its totient is φ = 72692027904.
The previous prime is 254422100291. The next prime is 254422100353. The reversal of 254422100352 is 253001224452.
254422100352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (254422100353) 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 7 ways as a sum of consecutive naturals, for example, 47322852 + ... + 47328227.
It is an arithmetic number, because the mean of its divisors is an integer number (12068012700).
Almost surely, 2254422100352 is an apocalyptic number.
It is an amenable number.
254422100352 is an abundant number, since it is smaller than the sum of its proper divisors (517930712448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
254422100352 is an equidigital number, since it uses as much as digits as its factorization.
254422100352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94651103 (or 94651091 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 30.
The spelling of 254422100352 in words is "two hundred fifty-four billion, four hundred twenty-two million, one hundred thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •