Base | Representation |
---|---|
bin | 1110111011011000… |
… | …0100110100111000 |
3 | 101100021011110110022 |
4 | 3232312010310320 |
5 | 31201312343302 |
6 | 1501343110012 |
7 | 201205144445 |
oct | 35666046470 |
9 | 11307143408 |
10 | 4007152952 |
11 | 1776a2a360 |
12 | 939ba2308 |
13 | 4bb25742a |
14 | 2a02969cc |
15 | 186bd98a2 |
hex | eed84d38 |
4007152952 has 64 divisors (see below), whose sum is σ = 8618421600. Its totient is φ = 1729728000.
The previous prime is 4007152913. The next prime is 4007152957. The reversal of 4007152952 is 2592517004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4007152957) 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 15 ways as a sum of consecutive naturals, for example, 142802 + ... + 168542.
Almost surely, 24007152952 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 4007152952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4309210800).
4007152952 is an abundant number, since it is smaller than the sum of its proper divisors (4611268648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4007152952 is a wasteful number, since it uses less digits than its factorization.
4007152952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25848 (or 25844 counting only the distinct ones).
The product of its (nonzero) digits is 25200, while the sum is 35.
The square root of 4007152952 is about 63302.0769959407. The cubic root of 4007152952 is about 1588.3467054683.
Adding to 4007152952 its reverse (2592517004), we get a palindrome (6599669956).
The spelling of 4007152952 in words is "four billion, seven million, one hundred fifty-two thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •