Base | Representation |
---|---|
bin | 1110111101100001… |
… | …0111101010011010 |
3 | 101100220002012111010 |
4 | 3233120113222122 |
5 | 31211113034002 |
6 | 1502303514350 |
7 | 201344436504 |
oct | 35730275232 |
9 | 11326065433 |
10 | 4016143002 |
11 | 178100a753 |
12 | 940bb89b6 |
13 | 4c00843a1 |
14 | 2a1556d74 |
15 | 1878b346c |
hex | ef617a9a |
4016143002 has 16 divisors (see below), whose sum is σ = 8504773632. Its totient is φ = 1259966400.
The previous prime is 4016142989. The next prime is 4016143003. The reversal of 4016143002 is 2003416104.
It is a super-3 number, since 3×40161430023 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 4016143002.
It is not an unprimeable number, because it can be changed into a prime (4016143003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19686874 + ... + 19687077.
It is an arithmetic number, because the mean of its divisors is an integer number (531548352).
Almost surely, 24016143002 is an apocalyptic number.
4016143002 is an abundant number, since it is smaller than the sum of its proper divisors (4488630630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4016143002 is a wasteful number, since it uses less digits than its factorization.
4016143002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39373973.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 4016143002 is about 63373.0463367511. The cubic root of 4016143002 is about 1589.5336372050.
Adding to 4016143002 its reverse (2003416104), we get a palindrome (6019559106).
The spelling of 4016143002 in words is "four billion, sixteen million, one hundred forty-three thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •