Base | Representation |
---|---|
bin | 110011010010001100… |
… | …1000101110011101101 |
3 | 101112021022012121112010 |
4 | 1212210121011303231 |
5 | 3301022322120323 |
6 | 122332151431433 |
7 | 10646115310605 |
oct | 1464431056355 |
9 | 345238177463 |
10 | 110132223213 |
11 | 427858503a1 |
12 | 19417085579 |
13 | a501a135ac |
14 | 548a9a1c05 |
15 | 2ce8a14c93 |
hex | 19a4645ced |
110132223213 has 16 divisors (see below), whose sum is σ = 153235906560. Its totient is φ = 70225363824.
The previous prime is 110132223211. The next prime is 110132223251. The reversal of 110132223213 is 312322231011.
It is not a de Polignac number, because 110132223213 - 21 = 110132223211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110132223213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110132223211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1723920 + ... + 1786662.
It is an arithmetic number, because the mean of its divisors is an integer number (9577244160).
Almost surely, 2110132223213 is an apocalyptic number.
It is an amenable number.
110132223213 is a deficient number, since it is larger than the sum of its proper divisors (43103683347).
110132223213 is a wasteful number, since it uses less digits than its factorization.
110132223213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88208.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 110132223213 its reverse (312322231011), we get a palindrome (422454454224).
The spelling of 110132223213 in words is "one hundred ten billion, one hundred thirty-two million, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •