Base | Representation |
---|---|
bin | 111010110101011000000… |
… | …110111010010000010111 |
3 | 112022111210120121210120011 |
4 | 322311120012322100113 |
5 | 1012220122330311043 |
6 | 12333203102421051 |
7 | 565046234434120 |
oct | 72653006722027 |
9 | 15274716553504 |
10 | 4043042432023 |
11 | 1319710061941 |
12 | 55369a891787 |
13 | 23434629b01a |
14 | dd9819db047 |
15 | 7027eb1859d |
hex | 3ad581ba417 |
4043042432023 has 8 divisors (see below), whose sum is σ = 4639028768640. Its totient is φ = 3451658307000.
The previous prime is 4043042431973. The next prime is 4043042432027. The reversal of 4043042432023 is 3202342403404.
It is a happy number.
4043042432023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4043042432023 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4043042432027) 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, 1150551013 + ... + 1150554526.
It is an arithmetic number, because the mean of its divisors is an integer number (579878596080).
Almost surely, 24043042432023 is an apocalyptic number.
4043042432023 is a deficient number, since it is larger than the sum of its proper divisors (595986336617).
4043042432023 is a wasteful number, since it uses less digits than its factorization.
4043042432023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2301105797.
The product of its (nonzero) digits is 55296, while the sum is 31.
Adding to 4043042432023 its reverse (3202342403404), we get a palindrome (7245384835427).
The spelling of 4043042432023 in words is "four trillion, forty-three billion, forty-two million, four hundred thirty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •