Base | Representation |
---|---|
bin | 1010000010001001011100… |
… | …0011100100011000101101 |
3 | 1110001122112202200222020101 |
4 | 2200202113003210120231 |
5 | 2421222024114424323 |
6 | 35244011403351101 |
7 | 2216015333300653 |
oct | 240422703443055 |
9 | 43048482628211 |
10 | 11032010311213 |
11 | 3573716242571 |
12 | 12a20b1b22491 |
13 | 6204111338c8 |
14 | 2a1d489a0dd3 |
15 | 141e7ba30dad |
hex | a08970e462d |
11032010311213 has 8 divisors (see below), whose sum is σ = 11043825205760. Its totient is φ = 11020196921040.
The previous prime is 11032010311211. The next prime is 11032010311271. The reversal of 11032010311213 is 31211301023011.
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 11032010311213 - 21 = 11032010311211 is a prime.
It is a super-2 number, since 2×110320103112132 (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 (11032010311211) 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, 14617828 + ... + 15353986.
It is an arithmetic number, because the mean of its divisors is an integer number (1380478150720).
Almost surely, 211032010311213 is an apocalyptic number.
It is an amenable number.
11032010311213 is a deficient number, since it is larger than the sum of its proper divisors (11814894547).
11032010311213 is an equidigital number, since it uses as much as digits as its factorization.
11032010311213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 752187.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11032010311213 its reverse (31211301023011), we get a palindrome (42243311334224).
The spelling of 11032010311213 in words is "eleven trillion, thirty-two billion, ten million, three hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •