Base | Representation |
---|---|
bin | 1100000010001001011001… |
… | …1100000111001000000111 |
3 | 1201211212120202110020122101 |
4 | 3000202112130013020013 |
5 | 3213234113421121203 |
6 | 44050125334012531 |
7 | 2533624042530514 |
oct | 300422634071007 |
9 | 51755522406571 |
10 | 13231023223303 |
11 | 424127774a816 |
12 | 1598316aa7147 |
13 | 74c8ac34b152 |
14 | 33a5563c630b |
15 | 17e2814a241d |
hex | c0896707207 |
13231023223303 has 8 divisors (see below), whose sum is σ = 13318752692960. Its totient is φ = 13143295159200.
The previous prime is 13231023223273. The next prime is 13231023223307. The reversal of 13231023223303 is 30332232013231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13231023223303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13231023223307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24208201 + ... + 24748717.
It is an arithmetic number, because the mean of its divisors is an integer number (1664844086620).
Almost surely, 213231023223303 is an apocalyptic number.
13231023223303 is a deficient number, since it is larger than the sum of its proper divisors (87729469657).
13231023223303 is a wasteful number, since it uses less digits than its factorization.
13231023223303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702777.
The product of its (nonzero) digits is 11664, while the sum is 28.
Adding to 13231023223303 its reverse (30332232013231), we get a palindrome (43563255236534).
The spelling of 13231023223303 in words is "thirteen trillion, two hundred thirty-one billion, twenty-three million, two hundred twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •