Base | Representation |
---|---|
bin | 1100000100000011011000… |
… | …0110101100110101100111 |
3 | 1201222000002201011001020102 |
4 | 3001000312012230311213 |
5 | 3214303143241024411 |
6 | 44113142413054315 |
7 | 2536163335021364 |
oct | 301006606546547 |
9 | 51860081131212 |
10 | 13263766736231 |
11 | 425414a59a700 |
12 | 15a273478739b |
13 | 7529c9c2347b |
14 | 33bd80d4d46b |
15 | 18004ada8d3b |
hex | c10361acd67 |
13263766736231 has 12 divisors (see below), whose sum is σ = 14723529965592. Its totient is φ = 11938583910000.
The previous prime is 13263766736219. The next prime is 13263766736249.
13263766736231 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 13263766736231 - 210 = 13263766735207 is a prime.
It is a super-2 number, since 2×132637667362312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13263766736431) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 542650685 + ... + 542675126.
It is an arithmetic number, because the mean of its divisors is an integer number (1226960830466).
Almost surely, 213263766736231 is an apocalyptic number.
13263766736231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13263766736231 is a deficient number, since it is larger than the sum of its proper divisors (1459763229361).
13263766736231 is a wasteful number, since it uses less digits than its factorization.
13263766736231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1085325934 (or 1085325923 counting only the distinct ones).
The product of its digits is 20575296, while the sum is 56.
The spelling of 13263766736231 in words is "thirteen trillion, two hundred sixty-three billion, seven hundred sixty-six million, seven hundred thirty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •