Base | Representation |
---|---|
bin | 110011011000011110… |
… | …1001100100000100001 |
3 | 101112210222211220201100 |
4 | 1212300331030200201 |
5 | 3301440302430213 |
6 | 122405121425013 |
7 | 10654255101351 |
oct | 1466075144041 |
9 | 345728756640 |
10 | 110343014433 |
11 | 42883833a13 |
12 | 1947579b169 |
13 | a5365a8622 |
14 | 54aa992b61 |
15 | 2d0c2a1773 |
hex | 19b0f4c821 |
110343014433 has 6 divisors (see below), whose sum is σ = 159384354194. Its totient is φ = 73562009616.
The previous prime is 110343014413. The next prime is 110343014437. The reversal of 110343014433 is 334410343011.
It can be written as a sum of positive squares in only one way, i.e., 67637965329 + 42705049104 = 260073^2 + 206652^2 .
It is not a de Polignac number, because 110343014433 - 210 = 110343013409 is a prime.
It is a super-2 number, since 2×1103430144332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110343014397 and 110343014406.
It is not an unprimeable number, because it can be changed into a prime (110343014437) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6130167460 + ... + 6130167477.
Almost surely, 2110343014433 is an apocalyptic number.
It is an amenable number.
110343014433 is a deficient number, since it is larger than the sum of its proper divisors (49041339761).
110343014433 is a wasteful number, since it uses less digits than its factorization.
110343014433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12260334943 (or 12260334940 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 110343014433 its reverse (334410343011), we get a palindrome (444753357444).
The spelling of 110343014433 in words is "one hundred ten billion, three hundred forty-three million, fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •