Base | Representation |
---|---|
bin | 1100000111111011010100… |
… | …0110111000110101000111 |
3 | 1202012100220001121211000221 |
4 | 3001332311012320311013 |
5 | 3221400444413014343 |
6 | 44203510531245211 |
7 | 2544040543315003 |
oct | 301766506706507 |
9 | 52170801554027 |
10 | 13330322001223 |
11 | 427a3a3281337 |
12 | 15b3609a49807 |
13 | 7590757b1186 |
14 | 341296271703 |
15 | 181b43d775ed |
hex | c1fb51b8d47 |
13330322001223 has 8 divisors (see below), whose sum is σ = 13529346850800. Its totient is φ = 13131299058240.
The previous prime is 13330322001211. The next prime is 13330322001229. The reversal of 13330322001223 is 32210022303331.
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 13330322001223 - 233 = 13321732066631 is a prime.
It is a super-2 number, since 2×133303220012232 (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 (13330322001229) 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, 20359353 + ... + 21003901.
It is an arithmetic number, because the mean of its divisors is an integer number (1691168356350).
Almost surely, 213330322001223 is an apocalyptic number.
13330322001223 is a deficient number, since it is larger than the sum of its proper divisors (199024849577).
13330322001223 is an equidigital number, since it uses as much as digits as its factorization.
13330322001223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 953297.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 13330322001223 its reverse (32210022303331), we get a palindrome (45540344304554).
The spelling of 13330322001223 in words is "thirteen trillion, three hundred thirty billion, three hundred twenty-two million, one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •