Base | Representation |
---|---|
bin | 110000111011001001… |
… | …1111011010010001001 |
3 | 101001012002201211021111 |
4 | 1201312103323102021 |
5 | 3210132410301103 |
6 | 120133225210321 |
7 | 10406405353444 |
oct | 1416623732211 |
9 | 331162654244 |
10 | 105064150153 |
11 | 40614a79066 |
12 | 184419309a1 |
13 | 9ba4a3c2b1 |
14 | 512986065b |
15 | 2aedb1386d |
hex | 18764fb489 |
105064150153 has 2 divisors, whose sum is σ = 105064150154. Its totient is φ = 105064150152.
The previous prime is 105064150133. The next prime is 105064150183. The reversal of 105064150153 is 351051460501.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71188643344 + 33875506809 = 266812^2 + 184053^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105064150153 is a prime.
It is a super-2 number, since 2×1050641501532 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105064150133) 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 as a sum of consecutive naturals, namely, 52532075076 + 52532075077.
It is an arithmetic number, because the mean of its divisors is an integer number (52532075077).
Almost surely, 2105064150153 is an apocalyptic number.
It is an amenable number.
105064150153 is a deficient number, since it is larger than the sum of its proper divisors (1).
105064150153 is an equidigital number, since it uses as much as digits as its factorization.
105064150153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 31.
The spelling of 105064150153 in words is "one hundred five billion, sixty-four million, one hundred fifty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •