Base | Representation |
---|---|
bin | 1010000010111001111000… |
… | …0001100000001111011001 |
3 | 1110002220002212212220101110 |
4 | 2200232132001200033121 |
5 | 2421430141100043340 |
6 | 35254001501210533 |
7 | 2216655460626501 |
oct | 240563601401731 |
9 | 43086085786343 |
10 | 11045012112345 |
11 | 3579188438162 |
12 | 12a4720260a49 |
13 | 6217039b6363 |
14 | 2a281d678a01 |
15 | 14248d1db680 |
hex | a0b9e0603d9 |
11045012112345 has 8 divisors (see below), whose sum is σ = 17672019379776. Its totient is φ = 5890673126576.
The previous prime is 11045012112157. The next prime is 11045012112359. The reversal of 11045012112345 is 54321121054011.
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 11045012112345 - 219 = 11045011588057 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 368167070397 + ... + 368167070426.
It is an arithmetic number, because the mean of its divisors is an integer number (2209002422472).
Almost surely, 211045012112345 is an apocalyptic number.
11045012112345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
11045012112345 is a deficient number, since it is larger than the sum of its proper divisors (6627007267431).
11045012112345 is an equidigital number, since it uses as much as digits as its factorization.
11045012112345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 736334140831.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 11045012112345 its reverse (54321121054011), we get a palindrome (65366133166356).
The spelling of 11045012112345 in words is "eleven trillion, forty-five billion, twelve million, one hundred twelve thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •