Base | Representation |
---|---|
bin | 110001000001001011… |
… | …1001001011111001011 |
3 | 101001201012011012000210 |
4 | 1202002113021133023 |
5 | 3211041134240410 |
6 | 120205250332203 |
7 | 10414411653036 |
oct | 1420227113713 |
9 | 331635135023 |
10 | 105266321355 |
11 | 407091042a8 |
12 | 1849958a063 |
13 | 9c078a6920 |
14 | 514864a01d |
15 | 2b1174b220 |
hex | 18825c97cb |
105266321355 has 128 divisors (see below), whose sum is σ = 191089704960. Its totient is φ = 49138951680.
The previous prime is 105266321327. The next prime is 105266321383. The reversal of 105266321355 is 553123662501.
It is an interprime number because it is at equal distance from previous prime (105266321327) and next prime (105266321383).
It is not a de Polignac number, because 105266321355 - 28 = 105266321099 is a prime.
It is a super-2 number, since 2×1052663213552 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 51625426 + ... + 51627464.
It is an arithmetic number, because the mean of its divisors is an integer number (1492888320).
Almost surely, 2105266321355 is an apocalyptic number.
105266321355 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105266321355 is a deficient number, since it is larger than the sum of its proper divisors (85823383605).
105266321355 is a wasteful number, since it uses less digits than its factorization.
105266321355 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2281.
The product of its (nonzero) digits is 162000, while the sum is 39.
Adding to 105266321355 its reverse (553123662501), we get a palindrome (658389983856).
The spelling of 105266321355 in words is "one hundred five billion, two hundred sixty-six million, three hundred twenty-one thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •