Base | Representation |
---|---|
bin | 1100010000000… |
… | …01111010000111 |
3 | 21011101011112222 |
4 | 12020001322013 |
5 | 202302041023 |
6 | 14110402555 |
7 | 2355341633 |
oct | 610017207 |
9 | 234334488 |
10 | 102768263 |
11 | 53012354 |
12 | 2a50045b |
13 | 183a2830 |
14 | d911dc3 |
15 | 904ecc8 |
hex | 6201e87 |
102768263 has 8 divisors (see below), whose sum is σ = 113373456. Its totient is φ = 92548800.
The previous prime is 102768251. The next prime is 102768269. The reversal of 102768263 is 362867201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102768263 - 226 = 35659399 is a prime.
It is a super-2 number, since 2×1027682632 = 21122631760074338, which 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 (102768269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 95873 + ... + 96938.
It is an arithmetic number, because the mean of its divisors is an integer number (14171682).
Almost surely, 2102768263 is an apocalyptic number.
102768263 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
102768263 is a deficient number, since it is larger than the sum of its proper divisors (10605193).
102768263 is a wasteful number, since it uses less digits than its factorization.
102768263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192865.
The product of its (nonzero) digits is 24192, while the sum is 35.
The square root of 102768263 is about 10137.4682736865. The cubic root of 102768263 is about 468.4030044003.
The spelling of 102768263 in words is "one hundred two million, seven hundred sixty-eight thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •