Base | Representation |
---|---|
bin | 1111000011101110… |
… | …0010110101010100 |
3 | 101102201000001001101 |
4 | 3300323202311110 |
5 | 31234242003022 |
6 | 1505033035444 |
7 | 202111426450 |
oct | 36073426524 |
9 | 11381001041 |
10 | 4042141012 |
11 | 1794757408 |
12 | 949855b84 |
13 | 4c5587920 |
14 | 2a4ba3660 |
15 | 189ceb627 |
hex | f0ee2d54 |
4042141012 has 48 divisors (see below), whose sum is σ = 8728836480. Its totient is φ = 1594922112.
The previous prime is 4042141001. The next prime is 4042141031. The reversal of 4042141012 is 2101412404.
It is a congruent number.
It is an unprimeable number.
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, 127323 + ... + 155869.
It is an arithmetic number, because the mean of its divisors is an integer number (181850760).
Almost surely, 24042141012 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 4042141012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4364418240).
4042141012 is an abundant number, since it is smaller than the sum of its proper divisors (4686695468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4042141012 is a wasteful number, since it uses less digits than its factorization.
4042141012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28960 (or 28958 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 19.
The square root of 4042141012 is about 63577.8342820829. The cubic root of 4042141012 is about 1592.9561465237.
Adding to 4042141012 its reverse (2101412404), we get a palindrome (6143553416).
The spelling of 4042141012 in words is "four billion, forty-two million, one hundred forty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •