Base | Representation |
---|---|
bin | 110000111011001001… |
… | …1111011010001110101 |
3 | 101001012002201211020202 |
4 | 1201312103323101311 |
5 | 3210132410301013 |
6 | 120133225210245 |
7 | 10406405353415 |
oct | 1416623732165 |
9 | 331162654222 |
10 | 105064150133 |
11 | 40614a79048 |
12 | 18441930985 |
13 | 9ba4a3c297 |
14 | 5129860645 |
15 | 2aedb13858 |
hex | 18764fb475 |
105064150133 has 2 divisors, whose sum is σ = 105064150134. Its totient is φ = 105064150132.
The previous prime is 105064150117. The next prime is 105064150153. The reversal of 105064150133 is 331051460501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70637945284 + 34426204849 = 265778^2 + 185543^2 .
It is a cyclic number.
It is not a de Polignac number, because 105064150133 - 24 = 105064150117 is a prime.
It is a super-2 number, since 2×1050641501332 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105064150096 and 105064150105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105064150153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52532075066 + 52532075067.
It is an arithmetic number, because the mean of its divisors is an integer number (52532075067).
Almost surely, 2105064150133 is an apocalyptic number.
It is an amenable number.
105064150133 is a deficient number, since it is larger than the sum of its proper divisors (1).
105064150133 is an equidigital number, since it uses as much as digits as its factorization.
105064150133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 29.
The spelling of 105064150133 in words is "one hundred five billion, sixty-four million, one hundred fifty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •