Base | Representation |
---|---|
bin | 1011001111011… |
… | …1001111110110 |
3 | 10021201110201220 |
4 | 2303313033312 |
5 | 44032300240 |
6 | 4402331210 |
7 | 1111524522 |
oct | 263671766 |
9 | 107643656 |
10 | 47150070 |
11 | 24684600 |
12 | 13959b06 |
13 | 99cb166 |
14 | 6394d82 |
15 | 42155d0 |
hex | 2cf73f6 |
47150070 has 96 divisors (see below), whose sum is σ = 128701440. Its totient is φ = 11035200.
The previous prime is 47150053. The next prime is 47150087. The reversal of 47150070 is 7005174.
It is an interprime number because it is at equal distance from previous prime (47150053) and next prime (47150087).
It is a self number, because there is not a number n which added to its sum of digits gives 47150070.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 112321 + ... + 112739.
It is an arithmetic number, because the mean of its divisors is an integer number (1340640).
Almost surely, 247150070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 47150070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64350720).
47150070 is an abundant number, since it is smaller than the sum of its proper divisors (81551370).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
47150070 is a wasteful number, since it uses less digits than its factorization.
47150070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 482 (or 471 counting only the distinct ones).
The product of its (nonzero) digits is 980, while the sum is 24.
The square root of 47150070 is about 6866.5908571867. The cubic root of 47150070 is about 361.2662967628.
Subtracting from 47150070 its reverse (7005174), we obtain a square (40144896 = 63362).
The spelling of 47150070 in words is "forty-seven million, one hundred fifty thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •