Base | Representation |
---|---|
bin | 1100000010001001110001… |
… | …1011001101110000010011 |
3 | 1201211212211202102112101001 |
4 | 3000202130123031300103 |
5 | 3213234320123322403 |
6 | 44050143322322431 |
7 | 2533626402255424 |
oct | 300423433156023 |
9 | 51755752375331 |
10 | 13231123651603 |
11 | 4241319404010 |
12 | 1598344659417 |
13 | 74c8c70b1890 |
14 | 33a56588964b |
15 | 17e28a1ddc1d |
hex | c089c6cdc13 |
13231123651603 has 16 divisors (see below), whose sum is σ = 15561395410176. Its totient is φ = 11090799217440.
The previous prime is 13231123651567. The next prime is 13231123651609. The reversal of 13231123651603 is 30615632113231.
It is a cyclic number.
It is not a de Polignac number, because 13231123651603 - 213 = 13231123643411 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13231123651609) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50876551 + ... + 51135952.
It is an arithmetic number, because the mean of its divisors is an integer number (972587213136).
Almost surely, 213231123651603 is an apocalyptic number.
13231123651603 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13231123651603 is a deficient number, since it is larger than the sum of its proper divisors (2330271758573).
13231123651603 is a wasteful number, since it uses less digits than its factorization.
13231123651603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102013434.
The product of its (nonzero) digits is 58320, while the sum is 37.
Adding to 13231123651603 its reverse (30615632113231), we get a palindrome (43846755764834).
The spelling of 13231123651603 in words is "thirteen trillion, two hundred thirty-one billion, one hundred twenty-three million, six hundred fifty-one thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •