Base | Representation |
---|---|
bin | 111010110101110011101… |
… | …100010111001001010001 |
3 | 112022112222211110121020010 |
4 | 322311303230113021101 |
5 | 1012222044320001023 |
6 | 12333321034105133 |
7 | 565063554254403 |
oct | 72656354271121 |
9 | 15275884417203 |
10 | 4043505234513 |
11 | 1319928322238 |
12 | 5537a987b1a9 |
13 | 2343bb12b054 |
14 | dd9c726cb73 |
15 | 702aa585093 |
hex | 3ad73b17251 |
4043505234513 has 8 divisors (see below), whose sum is σ = 5708477978208. Its totient is φ = 2537101323584.
The previous prime is 4043505234497. The next prime is 4043505234541. The reversal of 4043505234513 is 3154325053404.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4043505234513 - 24 = 4043505234497 is a prime.
It is a super-3 number, since 3×40435052345133 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (4043505234553) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 39642208131 + ... + 39642208232.
It is an arithmetic number, because the mean of its divisors is an integer number (713559747276).
Almost surely, 24043505234513 is an apocalyptic number.
It is an amenable number.
4043505234513 is a deficient number, since it is larger than the sum of its proper divisors (1664972743695).
4043505234513 is a wasteful number, since it uses less digits than its factorization.
4043505234513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79284416383.
The product of its (nonzero) digits is 432000, while the sum is 39.
The spelling of 4043505234513 in words is "four trillion, forty-three billion, five hundred five million, two hundred thirty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •