Base | Representation |
---|---|
bin | 1100000110101111101110… |
… | …0111000011100000101111 |
3 | 1202010102111212122110110102 |
4 | 3001223323213003200233 |
5 | 3221032420140032343 |
6 | 44150313211301315 |
7 | 2542421644214033 |
oct | 301537347034057 |
9 | 52112455573412 |
10 | 13310030002223 |
11 | 427182aa43129 |
12 | 15ab6a614a83b |
13 | 75719077a486 |
14 | 3402cd29a1c3 |
15 | 18135767d3b8 |
hex | c1afb9c382f |
13310030002223 has 8 divisors (see below), whose sum is σ = 13635132712656. Its totient is φ = 12984949569600.
The previous prime is 13310030002177. The next prime is 13310030002273. The reversal of 13310030002223 is 32220003001331.
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 13310030002223 - 212 = 13310029998127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13310030002195 and 13310030002204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13310030002273) 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, 4356761 + ... + 6752882.
It is an arithmetic number, because the mean of its divisors is an integer number (1704391589082).
Almost surely, 213310030002223 is an apocalyptic number.
13310030002223 is a deficient number, since it is larger than the sum of its proper divisors (325102710433).
13310030002223 is a wasteful number, since it uses less digits than its factorization.
13310030002223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11138905.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13310030002223 its reverse (32220003001331), we get a palindrome (45530033003554).
The spelling of 13310030002223 in words is "thirteen trillion, three hundred ten billion, thirty million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •