Base | Representation |
---|---|
bin | 1011010100011… |
… | …01101111111010 |
3 | 20121200002021010 |
4 | 11222031233322 |
5 | 143301434232 |
6 | 13231054350 |
7 | 2232040164 |
oct | 552155772 |
9 | 217602233 |
10 | 94952442 |
11 | 496641a2 |
12 | 279713b6 |
13 | 168971a0 |
14 | c879934 |
15 | 85090cc |
hex | 5a8dbfa |
94952442 has 64 divisors (see below), whose sum is σ = 213663744. Its totient is φ = 27933120.
The previous prime is 94952387. The next prime is 94952447. The reversal of 94952442 is 24425949.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 94952442.
It is not an unprimeable number, because it can be changed into a prime (94952447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 258543 + ... + 258909.
It is an arithmetic number, because the mean of its divisors is an integer number (3338496).
Almost surely, 294952442 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 94952442, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106831872).
94952442 is an abundant number, since it is smaller than the sum of its proper divisors (118711302).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
94952442 is a wasteful number, since it uses less digits than its factorization.
94952442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523.
The product of its digits is 103680, while the sum is 39.
The square root of 94952442 is about 9744.3543654775. The cubic root of 94952442 is about 456.2141095931.
The spelling of 94952442 in words is "ninety-four million, nine hundred fifty-two thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •