Base | Representation |
---|---|
bin | 1100011100110100011100… |
… | …1100110000011001000111 |
3 | 1210110200100201221112122212 |
4 | 3013031013030300121013 |
5 | 3243241043324024011 |
6 | 45040431305414035 |
7 | 2612005336103063 |
oct | 307150714603107 |
9 | 53420321845585 |
10 | 13689255298631 |
11 | 43a8642813200 |
12 | 165109ba9a31b |
13 | 783b780770a3 |
14 | 3547c6314aa3 |
15 | 18b1502ce08b |
hex | c7347330647 |
13689255298631 has 24 divisors (see below), whose sum is σ = 15532827459072. Its totient is φ = 12042885531600.
The previous prime is 13689255298597. The next prime is 13689255298643.
It is a happy number.
13689255298631 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-13689255298631 is a prime.
It is a super-2 number, since 2×136892552986312 (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 (13689255298661) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 138748940 + ... + 138847566.
It is an arithmetic number, because the mean of its divisors is an integer number (647201144128).
Almost surely, 213689255298631 is an apocalyptic number.
13689255298631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13689255298631 is a deficient number, since it is larger than the sum of its proper divisors (1843572160441).
13689255298631 is a wasteful number, since it uses less digits than its factorization.
13689255298631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135683 (or 135672 counting only the distinct ones).
The product of its digits is 167961600, while the sum is 68.
The spelling of 13689255298631 in words is "thirteen trillion, six hundred eighty-nine billion, two hundred fifty-five million, two hundred ninety-eight thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •