Base | Representation |
---|---|
bin | 1010000010001001110111… |
… | …0010001101011100100001 |
3 | 1110001122211122010101100012 |
4 | 2200202131302031130201 |
5 | 2421222242014420223 |
6 | 35244030515134305 |
7 | 2216021203660424 |
oct | 240423562153441 |
9 | 43048748111305 |
10 | 11032123201313 |
11 | 3573773a38575 |
12 | 12a21238a4395 |
13 | 62042b63b596 |
14 | 2a1d599899bb |
15 | 141e868cec78 |
hex | a089dc8d721 |
11032123201313 has 8 divisors (see below), whose sum is σ = 11642012560320. Its totient is φ = 10425158971920.
The previous prime is 11032123201303. The next prime is 11032123201357. The reversal of 11032123201313 is 31310232123011.
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 11032123201313 - 228 = 11031854765857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11032123201303) by changing a digit.
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, 731274653 + ... + 731289738.
It is an arithmetic number, because the mean of its divisors is an integer number (1455251570040).
Almost surely, 211032123201313 is an apocalyptic number.
It is an amenable number.
11032123201313 is a deficient number, since it is larger than the sum of its proper divisors (609889359007).
11032123201313 is a wasteful number, since it uses less digits than its factorization.
11032123201313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1462564807.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11032123201313 its reverse (31310232123011), we get a palindrome (42342355324324).
The spelling of 11032123201313 in words is "eleven trillion, thirty-two billion, one hundred twenty-three million, two hundred one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •