Base | Representation |
---|---|
bin | 1010000010001010010110… |
… | …1000100110110010000011 |
3 | 1110001200011210221102212102 |
4 | 2200202211220212302003 |
5 | 2421223024223321004 |
6 | 35244051542021015 |
7 | 2216024363261555 |
oct | 240424550466203 |
9 | 43050153842772 |
10 | 11032254901379 |
11 | 35738313107a8 |
12 | 12a215ba1776b |
13 | 62044ca00b0a |
14 | 2a1d6d26d4d5 |
15 | 141e9324711e |
hex | a08a5a26c83 |
11032254901379 has 2 divisors, whose sum is σ = 11032254901380. Its totient is φ = 11032254901378.
The previous prime is 11032254901351. The next prime is 11032254901387. The reversal of 11032254901379 is 97310945223011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11032254901379 - 220 = 11032253852803 is a prime.
It is a super-2 number, since 2×110322549013792 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11032254901309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5516127450689 + 5516127450690.
It is an arithmetic number, because the mean of its divisors is an integer number (5516127450690).
Almost surely, 211032254901379 is an apocalyptic number.
11032254901379 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032254901379 is an equidigital number, since it uses as much as digits as its factorization.
11032254901379 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 408240, while the sum is 47.
The spelling of 11032254901379 in words is "eleven trillion, thirty-two billion, two hundred fifty-four million, nine hundred one thousand, three hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •