Base | Representation |
---|---|
bin | 1100000110110001001110… |
… | …1000110011011110100111 |
3 | 1202010110112222011122220002 |
4 | 3001230103220303132213 |
5 | 3221034231334122043 |
6 | 44150421211331515 |
7 | 2542434640466063 |
oct | 301542350633647 |
9 | 52113488148802 |
10 | 13310433114023 |
11 | 4271a17543a81 |
12 | 15ab799150b9b |
13 | 75722613b276 |
14 | 34032aa30aa3 |
15 | 18137cc58bb8 |
hex | c1b13a337a7 |
13310433114023 has 8 divisors (see below), whose sum is σ = 13345627947600. Its totient is φ = 13275243295488.
The previous prime is 13310433114007. The next prime is 13310433114029. The reversal of 13310433114023 is 32041133401331.
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 13310433114023 - 24 = 13310433114007 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 (13310433114029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4091543 + ... + 6584951.
It is an arithmetic number, because the mean of its divisors is an integer number (1668203493450).
Almost surely, 213310433114023 is an apocalyptic number.
13310433114023 is a deficient number, since it is larger than the sum of its proper divisors (35194833577).
13310433114023 is a wasteful number, since it uses less digits than its factorization.
13310433114023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2507521.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 13310433114023 its reverse (32041133401331), we get a palindrome (45351566515354).
The spelling of 13310433114023 in words is "thirteen trillion, three hundred ten billion, four hundred thirty-three million, one hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •