Base | Representation |
---|---|
bin | 110011011010111011… |
… | …1010000010110111111 |
3 | 101120000201202122212012 |
4 | 1212311313100112333 |
5 | 3302122341442143 |
6 | 122421222201435 |
7 | 10656304634513 |
oct | 1466567202677 |
9 | 346021678765 |
10 | 110425343423 |
11 | 429162559aa |
12 | 1949928327b |
13 | a54a672ac5 |
14 | 54b78a4143 |
15 | 2d14615418 |
hex | 19b5dd05bf |
110425343423 has 4 divisors (see below), whose sum is σ = 110426625408. Its totient is φ = 110424061440.
The previous prime is 110425343407. The next prime is 110425343453. The reversal of 110425343423 is 324343524011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110425343423 - 24 = 110425343407 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 110425343423.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110425343453) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 501698 + ... + 687423.
It is an arithmetic number, because the mean of its divisors is an integer number (27606656352).
Almost surely, 2110425343423 is an apocalyptic number.
110425343423 is a deficient number, since it is larger than the sum of its proper divisors (1281985).
110425343423 is an equidigital number, since it uses as much as digits as its factorization.
110425343423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1281984.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 110425343423 its reverse (324343524011), we get a palindrome (434768867434).
The spelling of 110425343423 in words is "one hundred ten billion, four hundred twenty-five million, three hundred forty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •