Base | Representation |
---|---|
bin | 1011111011001011000100… |
… | …0101111001010101111111 |
3 | 1201102102022212011221011210 |
4 | 2332302301011321111333 |
5 | 3204303230043101343 |
6 | 43515112440415503 |
7 | 2522153016143361 |
oct | 276626105712577 |
9 | 51372285157153 |
10 | 13111211300223 |
11 | 41a5484a74673 |
12 | 157905a177593 |
13 | 7414c71050ca |
14 | 33482c03ad31 |
15 | 17b0bcc9d333 |
hex | becb117957f |
13111211300223 has 4 divisors (see below), whose sum is σ = 17481615066968. Its totient is φ = 8740807533480.
The previous prime is 13111211300167. The next prime is 13111211300249. The reversal of 13111211300223 is 32200311211131.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13111211300223 - 241 = 10912188044671 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13111211300223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111211300023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2185201883368 + ... + 2185201883373.
It is an arithmetic number, because the mean of its divisors is an integer number (4370403766742).
Almost surely, 213111211300223 is an apocalyptic number.
13111211300223 is a deficient number, since it is larger than the sum of its proper divisors (4370403766745).
13111211300223 is an equidigital number, since it uses as much as digits as its factorization.
13111211300223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4370403766744.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13111211300223 its reverse (32200311211131), we get a palindrome (45311522511354).
The spelling of 13111211300223 in words is "thirteen trillion, one hundred eleven billion, two hundred eleven million, three hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •