Base | Representation |
---|---|
bin | 111011101010011100011… |
… | …011110010100011000011 |
3 | 112111221212200020101022101 |
4 | 323222130123302203003 |
5 | 1014133321433043021 |
6 | 12415305201051231 |
7 | 602134254203056 |
oct | 73523433624303 |
9 | 15457780211271 |
10 | 4100023331011 |
11 | 13408a03126a3 |
12 | 562741626b17 |
13 | 2398273b67ba |
14 | 102629514a9d |
15 | 719b72a2a91 |
hex | 3ba9c6f28c3 |
4100023331011 has 8 divisors (see below), whose sum is σ = 4322391250464. Its totient is φ = 3881330914560.
The previous prime is 4100023330981. The next prime is 4100023331039. The reversal of 4100023331011 is 1101333200014.
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 4100023331011 - 27 = 4100023330883 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4100023331011.
It is not an unprimeable number, because it can be changed into a prime (4100023331311) 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, 918873460 + ... + 918877921.
It is an arithmetic number, because the mean of its divisors is an integer number (540298906308).
Almost surely, 24100023331011 is an apocalyptic number.
4100023331011 is a deficient number, since it is larger than the sum of its proper divisors (222367919453).
4100023331011 is a wasteful number, since it uses less digits than its factorization.
4100023331011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1837751501.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 4100023331011 its reverse (1101333200014), we get a palindrome (5201356531025).
The spelling of 4100023331011 in words is "four trillion, one hundred billion, twenty-three million, three hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •