Base | Representation |
---|---|
bin | 1010010010100111101100… |
… | …1101101101111100101111 |
3 | 1111001201000120112010021220 |
4 | 2210221323031231330233 |
5 | 2440341120312120221 |
6 | 40022013323354423 |
7 | 2245324344013662 |
oct | 244517315557457 |
9 | 44051016463256 |
10 | 11315011051311 |
11 | 367273a836240 |
12 | 1328b12382a13 |
13 | 64100216ac36 |
14 | 2b19141776d9 |
15 | 1494e1b120c6 |
hex | a4a7b36df2f |
11315011051311 has 16 divisors (see below), whose sum is σ = 16459340959488. Its totient is φ = 6857106177600.
The previous prime is 11315011051271. The next prime is 11315011051319.
11315011051311 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11315011051311 - 29 = 11315011050799 is a prime.
It is a super-2 number, since 2×113150110513112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11315011051319) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11424310 + ... + 12375171.
It is an arithmetic number, because the mean of its divisors is an integer number (1028708809968).
Almost surely, 211315011051311 is an apocalyptic number.
11315011051311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11315011051311 is a deficient number, since it is larger than the sum of its proper divisors (5144329908177).
11315011051311 is a wasteful number, since it uses less digits than its factorization.
11315011051311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23813902.
The product of its (nonzero) digits is 225, while the sum is 24.
It can be divided in two parts, 1131501 and 1051311, that added together give a palindrome (2182812).
The spelling of 11315011051311 in words is "eleven trillion, three hundred fifteen billion, eleven million, fifty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •