Base | Representation |
---|---|
bin | 1011111011011010000101… |
… | …1110011000011111111011 |
3 | 1201102210201220220001202221 |
4 | 2332312201132120133323 |
5 | 3204340010012014011 |
6 | 43521020544504511 |
7 | 2522354656515631 |
oct | 276664136303773 |
9 | 51383656801687 |
10 | 13115244251131 |
11 | 41a7164514350 |
12 | 15799a491b137 |
13 | 7419ba7c29a9 |
14 | 334ad18cb351 |
15 | 17b256d81971 |
hex | beda17987fb |
13115244251131 has 16 divisors (see below), whose sum is σ = 14312523696768. Its totient is φ = 11918796364800.
The previous prime is 13115244251129. The next prime is 13115244251203.
13115244251131 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 13115244251131 - 21 = 13115244251129 is a prime.
It is a super-2 number, since 2×131152442511312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13115244251831) 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, 499291860 + ... + 499318126.
It is an arithmetic number, because the mean of its divisors is an integer number (894532731048).
Almost surely, 213115244251131 is an apocalyptic number.
13115244251131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13115244251131 is a deficient number, since it is larger than the sum of its proper divisors (1197279445637).
13115244251131 is a wasteful number, since it uses less digits than its factorization.
13115244251131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40362.
The product of its digits is 14400, while the sum is 34.
It can be divided in two parts, 1311524 and 4251131, that added together give a palindrome (5562655).
The spelling of 13115244251131 in words is "thirteen trillion, one hundred fifteen billion, two hundred forty-four million, two hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •