Base | Representation |
---|---|
bin | 1100001110111… |
… | …11001111010101 |
3 | 21011002221202122 |
4 | 12013133033111 |
5 | 202233020021 |
6 | 14103345325 |
7 | 2354210633 |
oct | 607371725 |
9 | 234087678 |
10 | 102626261 |
11 | 52a256a1 |
12 | 2a452245 |
13 | 18352cca |
14 | d8b6353 |
15 | 9022bab |
hex | 61df3d5 |
102626261 has 4 divisors (see below), whose sum is σ = 103534572. Its totient is φ = 101717952.
The previous prime is 102626257. The next prime is 102626269. The reversal of 102626261 is 162626201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 21446161 + 81180100 = 4631^2 + 9010^2 .
It is a cyclic number.
It is not a de Polignac number, because 102626261 - 22 = 102626257 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102626261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102626269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 453986 + ... + 454211.
It is an arithmetic number, because the mean of its divisors is an integer number (25883643).
Almost surely, 2102626261 is an apocalyptic number.
It is an amenable number.
102626261 is a deficient number, since it is larger than the sum of its proper divisors (908311).
102626261 is an equidigital number, since it uses as much as digits as its factorization.
102626261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 908310.
The product of its (nonzero) digits is 1728, while the sum is 26.
The square root of 102626261 is about 10130.4620328986. The cubic root of 102626261 is about 468.1871633720.
The spelling of 102626261 in words is "one hundred two million, six hundred twenty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •