Base | Representation |
---|---|
bin | 1110111001111101… |
… | …1001111011000100 |
3 | 101022211222112022220 |
4 | 3232133121323010 |
5 | 31143302210202 |
6 | 1501011452340 |
7 | 201103503300 |
oct | 35637317304 |
9 | 11284875286 |
10 | 4001210052 |
11 | 1773640374 |
12 | 937bb70b0 |
13 | 4b9c56418 |
14 | 29d58ad00 |
15 | 186413abc |
hex | ee7d9ec4 |
4001210052 has 144 divisors (see below), whose sum is σ = 11271794688. Its totient is φ = 1100312640.
The previous prime is 4001210047. The next prime is 4001210077. The reversal of 4001210052 is 2500121004.
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, 4137273 + ... + 4138239.
It is an arithmetic number, because the mean of its divisors is an integer number (78276352).
Almost surely, 24001210052 is an apocalyptic number.
4001210052 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 4001210052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5635897344).
4001210052 is an abundant number, since it is smaller than the sum of its proper divisors (7270584636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4001210052 is a wasteful number, since it uses less digits than its factorization.
4001210052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1246 (or 1237 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 4001210052 is about 63255.1187810125. The cubic root of 4001210052 is about 1587.5611056480.
Adding to 4001210052 its reverse (2500121004), we get a palindrome (6501331056).
The spelling of 4001210052 in words is "four billion, one million, two hundred ten thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •