Base | Representation |
---|---|
bin | 1100000111011001101110… |
… | …0010001010111110010111 |
3 | 1202011111121111210122122021 |
4 | 3001312123202022332113 |
5 | 3221224012032324343 |
6 | 44155415551114011 |
7 | 2543301210212344 |
oct | 301663342127627 |
9 | 52144544718567 |
10 | 13321303011223 |
11 | 427659529a699 |
12 | 15b1911512907 |
13 | 7582691123bc |
14 | 340a7c5157cb |
15 | 1817b71990ed |
hex | c1d9b88af97 |
13321303011223 has 8 divisors (see below), whose sum is σ = 14035253543600. Its totient is φ = 12608635411008.
The previous prime is 13321303011209. The next prime is 13321303011239. The reversal of 13321303011223 is 32211030312331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13321303011223 - 221 = 13321300914071 is a prime.
It is a super-2 number, since 2×133213030112232 (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 (13321303011283) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 320711718 + ... + 320753251.
It is an arithmetic number, because the mean of its divisors is an integer number (1754406692950).
Almost surely, 213321303011223 is an apocalyptic number.
13321303011223 is a deficient number, since it is larger than the sum of its proper divisors (713950532377).
13321303011223 is a wasteful number, since it uses less digits than its factorization.
13321303011223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 641466081.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13321303011223 its reverse (32211030312331), we get a palindrome (45532333323554).
The spelling of 13321303011223 in words is "thirteen trillion, three hundred twenty-one billion, three hundred three million, eleven thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •