Base | Representation |
---|---|
bin | 1100000001001010000100… |
… | …0110110111001111011011 |
3 | 1201210020200221021120000111 |
4 | 3000102201012313033123 |
5 | 3212444304204132103 |
6 | 44034234341545151 |
7 | 2532452535412033 |
oct | 300224106671733 |
9 | 51706627246014 |
10 | 13214022333403 |
11 | 4235043133591 |
12 | 1594b714151b7 |
13 | 74b100105998 |
14 | 3397c25548c3 |
15 | 17dad8ba186d |
hex | c04a11b73db |
13214022333403 has 8 divisors (see below), whose sum is σ = 13585743374400. Its totient is φ = 12846075110400.
The previous prime is 13214022333397. The next prime is 13214022333439. The reversal of 13214022333403 is 30433322041231.
It is a happy number.
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 13214022333403 - 25 = 13214022333371 is a prime.
It is a super-2 number, since 2×132140223334032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13214022337403) 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, 943447398 + ... + 943461403.
It is an arithmetic number, because the mean of its divisors is an integer number (1698217921800).
Almost surely, 213214022333403 is an apocalyptic number.
13214022333403 is a deficient number, since it is larger than the sum of its proper divisors (371721040997).
13214022333403 is a wasteful number, since it uses less digits than its factorization.
13214022333403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1886908997.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 13214022333403 its reverse (30433322041231), we get a palindrome (43647344374634).
The spelling of 13214022333403 in words is "thirteen trillion, two hundred fourteen billion, twenty-two million, three hundred thirty-three thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •