Base | Representation |
---|---|
bin | 1100000111100000111010… |
… | …0100111111011001111110 |
3 | 1202011200121000122211222222 |
4 | 3001320032210333121332 |
5 | 3221241440140130420 |
6 | 44200335300205342 |
7 | 2543400065024201 |
oct | 301701644773176 |
9 | 52150530584888 |
10 | 13323233130110 |
11 | 4277395847572 |
12 | 15b216b999852 |
13 | 7584b5c60097 |
14 | 340bc29bd938 |
15 | 18187b856225 |
hex | c1e0e93f67e |
13323233130110 has 8 divisors (see below), whose sum is σ = 23981819634216. Its totient is φ = 5329293252040.
The previous prime is 13323233130107. The next prime is 13323233130127. The reversal of 13323233130110 is 1103133232331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×133232331301102 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13323233130110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 666161656496 + ... + 666161656515.
It is an arithmetic number, because the mean of its divisors is an integer number (2997727454277).
Almost surely, 213323233130110 is an apocalyptic number.
13323233130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13323233130110 is a deficient number, since it is larger than the sum of its proper divisors (10658586504106).
13323233130110 is a wasteful number, since it uses less digits than its factorization.
13323233130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1332323313018.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13323233130110 its reverse (1103133232331), we get a palindrome (14426366362441).
The spelling of 13323233130110 in words is "thirteen trillion, three hundred twenty-three billion, two hundred thirty-three million, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •