Base | Representation |
---|---|
bin | 11001000011110101000101… |
… | …011101110101000010111101 |
3 | 112110020101102112202022220220 |
4 | 121003311011131311002331 |
5 | 103421222412213330023 |
6 | 1030223432111331553 |
7 | 32133502424103000 |
oct | 3103650535650275 |
9 | 473211375668826 |
10 | 110214321230013 |
11 | 321326a4064480 |
12 | 10440335220bb9 |
13 | 4966220621520 |
14 | 1d3058a037537 |
15 | cb1dda0be3e3 |
hex | 643d457750bd |
110214321230013 has 128 divisors (see below), whose sum is σ = 206774879539200. Its totient is φ = 51421642594560.
The previous prime is 110214321230003. The next prime is 110214321230033. The reversal of 110214321230013 is 310032123412011.
It is not a de Polignac number, because 110214321230013 - 24 = 110214321229997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110214321230003) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4677295 + ... + 15566172.
It is an arithmetic number, because the mean of its divisors is an integer number (1615428746400).
Almost surely, 2110214321230013 is an apocalyptic number.
110214321230013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
110214321230013 is a deficient number, since it is larger than the sum of its proper divisors (96560558309187).
110214321230013 is a wasteful number, since it uses less digits than its factorization.
110214321230013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20243552 (or 20243538 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 110214321230013 its reverse (310032123412011), we get a palindrome (420246444642024).
The spelling of 110214321230013 in words is "one hundred ten trillion, two hundred fourteen billion, three hundred twenty-one million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •