Base | Representation |
---|---|
bin | 111010110101011100010… |
… | …100010001100000110111 |
3 | 112022111222111111021000102 |
4 | 322311130110101200313 |
5 | 1012220243414402043 |
6 | 12333214104104315 |
7 | 565051052560034 |
oct | 72653424214067 |
9 | 15274874437012 |
10 | 4043113044023 |
11 | 1319746a00769 |
12 | 5536ba46509b |
13 | 234357ac2281 |
14 | dd98b13c38b |
15 | 70285e156b8 |
hex | 3ad5c511837 |
4043113044023 has 4 divisors (see below), whose sum is σ = 4069888627248. Its totient is φ = 4016337460800.
The previous prime is 4043113044001. The next prime is 4043113044043. The reversal of 4043113044023 is 3204403113404.
It is a happy number.
4043113044023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4043113044023 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4043113044043) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13387791386 + ... + 13387791687.
It is an arithmetic number, because the mean of its divisors is an integer number (1017472156812).
Almost surely, 24043113044023 is an apocalyptic number.
4043113044023 is a deficient number, since it is larger than the sum of its proper divisors (26775583225).
4043113044023 is a wasteful number, since it uses less digits than its factorization.
4043113044023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26775583224.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 4043113044023 its reverse (3204403113404), we get a palindrome (7247516157427).
The spelling of 4043113044023 in words is "four trillion, forty-three billion, one hundred thirteen million, forty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •