Base | Representation |
---|---|
bin | 1111101100101100… |
… | …0001010110100000 |
3 | 101212200022212120102 |
4 | 3323023001112200 |
5 | 32112234022321 |
6 | 1534052001532 |
7 | 206266104542 |
oct | 37313012640 |
9 | 11780285512 |
10 | 4213970336 |
11 | 1872749314 |
12 | 9973002a8 |
13 | 52205a794 |
14 | 2bd931692 |
15 | 199e3dc0b |
hex | fb2c15a0 |
4213970336 has 48 divisors (see below), whose sum is σ = 8808621696. Its totient is φ = 1977547776.
The previous prime is 4213970263. The next prime is 4213970339. The reversal of 4213970336 is 6330793124.
It is a self number, because there is not a number n which added to its sum of digits gives 4213970336.
It is not an unprimeable number, because it can be changed into a prime (4213970339) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 189095 + ... + 210201.
It is an arithmetic number, because the mean of its divisors is an integer number (183512952).
Almost surely, 24213970336 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4213970336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4404310848).
4213970336 is an abundant number, since it is smaller than the sum of its proper divisors (4594651360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4213970336 is a wasteful number, since it uses less digits than its factorization.
4213970336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21501 (or 21493 counting only the distinct ones).
The product of its (nonzero) digits is 81648, while the sum is 38.
The square root of 4213970336 is about 64915.1009858261. The cubic root of 4213970336 is about 1615.2155662502.
The spelling of 4213970336 in words is "four billion, two hundred thirteen million, nine hundred seventy thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •