Base | Representation |
---|---|
bin | 11001000101011000101111… |
… | …000101110110111100110001 |
3 | 112110121121121110212112211222 |
4 | 121011120233011312330301 |
5 | 103430001030411430001 |
6 | 1030344525331114425 |
7 | 32144311103642123 |
oct | 3105305705667461 |
9 | 473547543775758 |
10 | 110321320030001 |
11 | 321740110a45a3 |
12 | 10459016a42a15 |
13 | 4973343106922 |
14 | 1d3581a7c1213 |
15 | cb4a9d98761b |
hex | 64562f176f31 |
110321320030001 has 4 divisors (see below), whose sum is σ = 110321619532272. Its totient is φ = 110321020527732.
The previous prime is 110321320029979. The next prime is 110321320030067. The reversal of 110321320030001 is 100030023123011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 110321320030001 - 226 = 110321252921137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110321320030501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 149197931 + ... + 149935536.
It is an arithmetic number, because the mean of its divisors is an integer number (27580404883068).
Almost surely, 2110321320030001 is an apocalyptic number.
It is an amenable number.
110321320030001 is a deficient number, since it is larger than the sum of its proper divisors (299502271).
110321320030001 is an equidigital number, since it uses as much as digits as its factorization.
110321320030001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299502270.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 110321320030001 its reverse (100030023123011), we get a palindrome (210351343153012).
The spelling of 110321320030001 in words is "one hundred ten trillion, three hundred twenty-one billion, three hundred twenty million, thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •