Base | Representation |
---|---|
bin | 1010010011101000000111… |
… | …1001010011110011001011 |
3 | 1111010100122200101200122001 |
4 | 2210322001321103303023 |
5 | 2441132024032323034 |
6 | 40033553234211431 |
7 | 2246506014156454 |
oct | 244720171236313 |
9 | 44110580350561 |
10 | 11332303011019 |
11 | 367a003687531 |
12 | 1330339423b77 |
13 | 6428297a5563 |
14 | 2b26b493612b |
15 | 149ba4c5aa14 |
hex | a4e81e53ccb |
11332303011019 has 2 divisors, whose sum is σ = 11332303011020. Its totient is φ = 11332303011018.
The previous prime is 11332303010969. The next prime is 11332303011047. The reversal of 11332303011019 is 91011030323311.
11332303011019 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (11332303011047) can be obtained adding 11332303011019 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11332303011019 - 237 = 11194864057547 is a prime.
It is a super-2 number, since 2×113323030110192 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11332303011079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5666151505509 + 5666151505510.
It is an arithmetic number, because the mean of its divisors is an integer number (5666151505510).
Almost surely, 211332303011019 is an apocalyptic number.
11332303011019 is a deficient number, since it is larger than the sum of its proper divisors (1).
11332303011019 is an equidigital number, since it uses as much as digits as its factorization.
11332303011019 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 28.
The spelling of 11332303011019 in words is "eleven trillion, three hundred thirty-two billion, three hundred three million, eleven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •