Base | Representation |
---|---|
bin | 1010010011010000110000… |
… | …0111110001010010010111 |
3 | 1111002202110122121120111101 |
4 | 2210310030013301102113 |
5 | 2441031203210414111 |
6 | 40031035103250531 |
7 | 2246164430411263 |
oct | 244641407612227 |
9 | 44082418546441 |
10 | 11326032123031 |
11 | 367738595657a |
12 | 132b0892a9a47 |
13 | 64206a562752 |
14 | 2b227bb710a3 |
15 | 149939464bc1 |
hex | a4d0c1f1497 |
11326032123031 has 8 divisors (see below), whose sum is σ = 11568532469760. Its totient is φ = 11083595148888.
The previous prime is 11326032123023. The next prime is 11326032123067. The reversal of 11326032123031 is 13032123062311.
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 11326032123031 - 23 = 11326032123023 is a prime.
It is a super-2 number, since 2×113260321230312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11326032129031) 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, 15481791 + ... + 16196848.
It is an arithmetic number, because the mean of its divisors is an integer number (1446066558720).
Almost surely, 211326032123031 is an apocalyptic number.
11326032123031 is a deficient number, since it is larger than the sum of its proper divisors (242500346729).
11326032123031 is an equidigital number, since it uses as much as digits as its factorization.
11326032123031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31686293.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 11326032123031 its reverse (13032123062311), we get a palindrome (24358155185342).
The spelling of 11326032123031 in words is "eleven trillion, three hundred twenty-six billion, thirty-two million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •