Base | Representation |
---|---|
bin | 110001001001001110… |
… | …0001000101011011111 |
3 | 101002101222201112200101 |
4 | 1202102130020223133 |
5 | 3212114213023343 |
6 | 120252124041531 |
7 | 10424165513302 |
oct | 1422234105337 |
9 | 332358645611 |
10 | 105536064223 |
11 | 408373a2097 |
12 | 185539932a7 |
13 | 9c4b73c6a5 |
14 | 51723c4b39 |
15 | 2b2a27ee4d |
hex | 1892708adf |
105536064223 has 4 divisors (see below), whose sum is σ = 106470011808. Its totient is φ = 104602116640.
The previous prime is 105536064197. The next prime is 105536064251. The reversal of 105536064223 is 322460635501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322460635501 = 7723 ⋅41753287.
It is a cyclic number.
It is not a de Polignac number, because 105536064223 - 25 = 105536064191 is a prime.
It is a super-2 number, since 2×1055360642232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105536062223) 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, 466973623 + ... + 466973848.
It is an arithmetic number, because the mean of its divisors is an integer number (26617502952).
Almost surely, 2105536064223 is an apocalyptic number.
105536064223 is a deficient number, since it is larger than the sum of its proper divisors (933947585).
105536064223 is an equidigital number, since it uses as much as digits as its factorization.
105536064223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 933947584.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 105536064223 its reverse (322460635501), we get a palindrome (427996699724).
The spelling of 105536064223 in words is "one hundred five billion, five hundred thirty-six million, sixty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •