Base | Representation |
---|---|
bin | 1010110000001110101111… |
… | …0100110100000010111011 |
3 | 1112212100001102201211121212 |
4 | 2230003223310310002323 |
5 | 3022204422330122034 |
6 | 41051422532153335 |
7 | 2330143316623565 |
oct | 254035364640273 |
9 | 45770042654555 |
10 | 11823706489019 |
11 | 3849451084797 |
12 | 13ab61b46884b |
13 | 679c80931709 |
14 | 2cc3b0172335 |
15 | 157865d112ce |
hex | ac0ebd340bb |
11823706489019 has 8 divisors (see below), whose sum is σ = 11842897432320. Its totient is φ = 11804516980200.
The previous prime is 11823706488991. The next prime is 11823706489061. The reversal of 11823706489019 is 91098460732811.
11823706489019 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 not a de Polignac number, because 11823706489019 - 228 = 11823438053563 is a prime.
It is a super-2 number, since 2×118237064890192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11823706489079) 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, 16805234 + ... + 17494664.
It is an arithmetic number, because the mean of its divisors is an integer number (1480362179040).
Almost surely, 211823706489019 is an apocalyptic number.
11823706489019 is a deficient number, since it is larger than the sum of its proper divisors (19190943301).
11823706489019 is an equidigital number, since it uses as much as digits as its factorization.
11823706489019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 717241.
The product of its (nonzero) digits is 5225472, while the sum is 59.
The spelling of 11823706489019 in words is "eleven trillion, eight hundred twenty-three billion, seven hundred six million, four hundred eighty-nine thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •