Base | Representation |
---|---|
bin | 10111101110000111010100… |
… | …011001001011101111001011 |
3 | 111200101021112121101010102001 |
4 | 113232013110121023233023 |
5 | 102133221100122232021 |
6 | 1005513443420051431 |
7 | 30655106366000251 |
oct | 2756072431135713 |
9 | 450337477333361 |
10 | 104324024024011 |
11 | 3027162a926940 |
12 | b84a840693b77 |
13 | 462993702b4ac |
14 | 1ba9449b845d1 |
15 | c0da920c3091 |
hex | 5ee1d464bbcb |
104324024024011 has 32 divisors (see below), whose sum is σ = 121126487731200. Its totient is φ = 88967306292480.
The previous prime is 104324024023963. The next prime is 104324024024023. The reversal of 104324024024011 is 110420420423401.
It is not a de Polignac number, because 104324024024011 - 211 = 104324024021963 is a prime.
It is a super-2 number, since 2×1043240240240112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104324024024411) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31872051 + ... + 34992508.
It is an arithmetic number, because the mean of its divisors is an integer number (3785202741600).
Almost surely, 2104324024024011 is an apocalyptic number.
104324024024011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
104324024024011 is a deficient number, since it is larger than the sum of its proper divisors (16802463707189).
104324024024011 is a wasteful number, since it uses less digits than its factorization.
104324024024011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66864739.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 104324024024011 its reverse (110420420423401), we get a palindrome (214744444447412).
The spelling of 104324024024011 in words is "one hundred four trillion, three hundred twenty-four billion, twenty-four million, twenty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •