Base | Representation |
---|---|
bin | 111010111110001111000… |
… | …000001010100111101011 |
3 | 112100102100102002021010102 |
4 | 322332033000022213223 |
5 | 1012344112124024030 |
6 | 12341414534340015 |
7 | 565534023034643 |
oct | 72761700124753 |
9 | 15312312067112 |
10 | 4052553345515 |
11 | 1322750793a24 |
12 | 5554b3aba60b |
13 | 23520085499c |
14 | 100204c09523 |
15 | 70639ab6c45 |
hex | 3af8f00a9eb |
4052553345515 has 4 divisors (see below), whose sum is σ = 4863064014624. Its totient is φ = 3242042676408.
The previous prime is 4052553345497. The next prime is 4052553345571. The reversal of 4052553345515 is 5155433552504.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4052553345515 - 214 = 4052553329131 is a prime.
It is a super-3 number, since 3×40525533455153 (a number of 39 digits) contains 333 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 4052553345515.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 405255334547 + ... + 405255334556.
It is an arithmetic number, because the mean of its divisors is an integer number (1215766003656).
Almost surely, 24052553345515 is an apocalyptic number.
4052553345515 is a deficient number, since it is larger than the sum of its proper divisors (810510669109).
4052553345515 is an equidigital number, since it uses as much as digits as its factorization.
4052553345515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 810510669108.
The product of its (nonzero) digits is 4500000, while the sum is 47.
The spelling of 4052553345515 in words is "four trillion, fifty-two billion, five hundred fifty-three million, three hundred forty-five thousand, five hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •