Base | Representation |
---|---|
bin | 110011010111100101… |
… | …1100101011010010101 |
3 | 101112201220210210221001 |
4 | 1212233023211122111 |
5 | 3301410141411041 |
6 | 122402135223301 |
7 | 10653444000226 |
oct | 1465713453225 |
9 | 345656723831 |
10 | 110313232021 |
11 | 42868a41a53 |
12 | 19467817b31 |
13 | a53037b6b5 |
14 | 54a6a3d24d |
15 | 2d0986c131 |
hex | 19af2e5695 |
110313232021 has 4 divisors (see below), whose sum is σ = 112660322112. Its totient is φ = 107966141932.
The previous prime is 110313231997. The next prime is 110313232049. The reversal of 110313232021 is 120232313011.
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 not a de Polignac number, because 110313232021 - 27 = 110313231893 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110313232021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110313232621) 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, 1173544975 + ... + 1173545068.
It is an arithmetic number, because the mean of its divisors is an integer number (28165080528).
Almost surely, 2110313232021 is an apocalyptic number.
It is an amenable number.
110313232021 is a deficient number, since it is larger than the sum of its proper divisors (2347090091).
110313232021 is an equidigital number, since it uses as much as digits as its factorization.
110313232021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2347090090.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 110313232021 its reverse (120232313011), we get a palindrome (230545545032).
The spelling of 110313232021 in words is "one hundred ten billion, three hundred thirteen million, two hundred thirty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •