Base | Representation |
---|---|
bin | 1010000000011100010111… |
… | …1011101010010010111111 |
3 | 1102221211222022101110202110 |
4 | 2200013011323222102333 |
5 | 2420232043342340401 |
6 | 35222330231425103 |
7 | 2213630645601264 |
oct | 240070573522277 |
9 | 42854868343673 |
10 | 11002731996351 |
11 | 356226140a237 |
12 | 12984a0825193 |
13 | 61a726431344 |
14 | 2a076c33726b |
15 | 14131645e9d6 |
hex | a01c5eea4bf |
11002731996351 has 16 divisors (see below), whose sum is σ = 14932993662720. Its totient is φ = 7204046414400.
The previous prime is 11002731996307. The next prime is 11002731996379. The reversal of 11002731996351 is 15369913720011.
It is not a de Polignac number, because 11002731996351 - 26 = 11002731996287 is a prime.
It is a super-2 number, since 2×110027319963512 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11002731996351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002731996551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29050950 + ... + 29427251.
It is an arithmetic number, because the mean of its divisors is an integer number (933312103920).
Almost surely, 211002731996351 is an apocalyptic number.
11002731996351 is a deficient number, since it is larger than the sum of its proper divisors (3930261666369).
11002731996351 is a wasteful number, since it uses less digits than its factorization.
11002731996351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58479326.
The product of its (nonzero) digits is 306180, while the sum is 48.
The spelling of 11002731996351 in words is "eleven trillion, two billion, seven hundred thirty-one million, nine hundred ninety-six thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •