Base | Representation |
---|---|
bin | 1100000111010101101100… |
… | …0110100100011000001111 |
3 | 1202011101211011202021212110 |
4 | 3001311123012210120033 |
5 | 3221214303320032143 |
6 | 44155120414035103 |
7 | 2543232343103514 |
oct | 301653306443017 |
9 | 52141734667773 |
10 | 13320222033423 |
11 | 4276090098008 |
12 | 15b166b4a8a93 |
13 | 758126191a76 |
14 | 3409b8b2930b |
15 | 18175231e533 |
hex | c1d5b1a460f |
13320222033423 has 8 divisors (see below), whose sum is σ = 17760411121536. Its totient is φ = 8880090483800.
The previous prime is 13320222033397. The next prime is 13320222033451. The reversal of 13320222033423 is 32433022202331.
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 13320222033423 - 29 = 13320222032911 is a prime.
It is a super-3 number, since 3×133202220334233 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13320222033323) 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, 13841523 + ... + 14772548.
It is an arithmetic number, because the mean of its divisors is an integer number (2220051390192).
Almost surely, 213320222033423 is an apocalyptic number.
13320222033423 is a deficient number, since it is larger than the sum of its proper divisors (4440189088113).
13320222033423 is a wasteful number, since it uses less digits than its factorization.
13320222033423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28769245.
The product of its (nonzero) digits is 31104, while the sum is 30.
Adding to 13320222033423 its reverse (32433022202331), we get a palindrome (45753244235754).
The spelling of 13320222033423 in words is "thirteen trillion, three hundred twenty billion, two hundred twenty-two million, thirty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •