Base | Representation |
---|---|
bin | 110011010001110101… |
… | …1010101110110110001 |
3 | 101112020110122022100221 |
4 | 1212203223111312301 |
5 | 3301011234332241 |
6 | 122331042413041 |
7 | 10645611341113 |
oct | 1464353256661 |
9 | 345213568327 |
10 | 110120230321 |
11 | 42779aa9a12 |
12 | 19413061181 |
13 | a4cc3a48ca |
14 | 548915d3b3 |
15 | 2ce79465d1 |
hex | 19a3ad5db1 |
110120230321 has 4 divisors (see below), whose sum is σ = 110130628644. Its totient is φ = 110109832000.
The previous prime is 110120230261. The next prime is 110120230373. The reversal of 110120230321 is 123032021011.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 103967553600 + 6152676721 = 322440^2 + 78439^2 .
It is a cyclic number.
It is not a de Polignac number, because 110120230321 - 215 = 110120197553 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110120230295 and 110120230304.
It is not an unprimeable number, because it can be changed into a prime (110120230621) 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, 5183260 + ... + 5204461.
It is an arithmetic number, because the mean of its divisors is an integer number (27532657161).
Almost surely, 2110120230321 is an apocalyptic number.
It is an amenable number.
110120230321 is a deficient number, since it is larger than the sum of its proper divisors (10398323).
110120230321 is a wasteful number, since it uses less digits than its factorization.
110120230321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10398322.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 110120230321 its reverse (123032021011), we get a palindrome (233152251332).
The spelling of 110120230321 in words is "one hundred ten billion, one hundred twenty million, two hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •