Base | Representation |
---|---|
bin | 101100001101011100… |
… | …0001110001000000000 |
3 | 100002001112210012020110 |
4 | 1120122320032020000 |
5 | 3023414144213143 |
6 | 111340454311320 |
7 | 6600464414643 |
oct | 1303270161000 |
9 | 302045705213 |
10 | 94940226048 |
11 | 3729a312038 |
12 | 16497358540 |
13 | 8c50482a65 |
14 | 484907da5a |
15 | 2709e27533 |
hex | 161ae0e200 |
94940226048 has 80 divisors (see below), whose sum is σ = 252992155680. Its totient is φ = 31638552576.
The previous prime is 94940226041. The next prime is 94940226053. The reversal of 94940226048 is 84062204949.
It is a super-3 number, since 3×949402260483 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 94940225988 and 94940226006.
It is not an unprimeable number, because it can be changed into a prime (94940226041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10023811 + ... + 10033277.
It is an arithmetic number, because the mean of its divisors is an integer number (3162401946).
Almost surely, 294940226048 is an apocalyptic number.
It is an amenable number.
94940226048 is an abundant number, since it is smaller than the sum of its proper divisors (158051929632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
94940226048 is an equidigital number, since it uses as much as digits as its factorization.
94940226048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16017 (or 16001 counting only the distinct ones).
The product of its (nonzero) digits is 995328, while the sum is 48.
The spelling of 94940226048 in words is "ninety-four billion, nine hundred forty million, two hundred twenty-six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •