Base | Representation |
---|---|
bin | 1110111101100000… |
… | …0001100010001011 |
3 | 101100212220121011010 |
4 | 3233120001202023 |
5 | 31211102133423 |
6 | 1502301535003 |
7 | 201343611321 |
oct | 35730014213 |
9 | 11325817133 |
10 | 4016052363 |
11 | 1780a58644 |
12 | 940b74463 |
13 | 4c005205b |
14 | 2a1531d11 |
15 | 187896693 |
hex | ef60188b |
4016052363 has 8 divisors (see below), whose sum is σ = 5636564800. Its totient is φ = 2536454088.
The previous prime is 4016052361. The next prime is 4016052419. The reversal of 4016052363 is 3632506104.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4016052363 - 21 = 4016052361 is a prime.
It is a super-2 number, since 2×40160523632 = 32257353164715767538, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4016052363.
It is not an unprimeable number, because it can be changed into a prime (4016052361) 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, 35228473 + ... + 35228586.
It is an arithmetic number, because the mean of its divisors is an integer number (704570600).
Almost surely, 24016052363 is an apocalyptic number.
4016052363 is a deficient number, since it is larger than the sum of its proper divisors (1620512437).
4016052363 is a wasteful number, since it uses less digits than its factorization.
4016052363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70457081.
The product of its (nonzero) digits is 12960, while the sum is 30.
The square root of 4016052363 is about 63372.3312100794. The cubic root of 4016052363 is about 1589.5216792291.
Adding to 4016052363 its reverse (3632506104), we get a palindrome (7648558467).
The spelling of 4016052363 in words is "four billion, sixteen million, fifty-two thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •