Base | Representation |
---|---|
bin | 1100001010111… |
… | …10101111111111 |
3 | 21010010012211021 |
4 | 12011132233333 |
5 | 202114144332 |
6 | 14044205011 |
7 | 2346556354 |
oct | 605365777 |
9 | 233105737 |
10 | 102099967 |
11 | 526a6242 |
12 | 2a239767 |
13 | 181ca5a8 |
14 | d7ba62b |
15 | 8e6bc97 |
hex | 615ebff |
102099967 has 4 divisors (see below), whose sum is σ = 106539120. Its totient is φ = 97660816.
The previous prime is 102099961. The next prime is 102099997. The reversal of 102099967 is 769990201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102099967 - 219 = 101575679 is a prime.
It is a super-2 number, since 2×1020999672 = 20848806522802178, 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 (102099961) 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 in 3 ways as a sum of consecutive naturals, for example, 2219542 + ... + 2219587.
It is an arithmetic number, because the mean of its divisors is an integer number (26634780).
Almost surely, 2102099967 is an apocalyptic number.
102099967 is a deficient number, since it is larger than the sum of its proper divisors (4439153).
102099967 is an equidigital number, since it uses as much as digits as its factorization.
102099967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4439152.
The product of its (nonzero) digits is 61236, while the sum is 43.
The square root of 102099967 is about 10104.4528303120. The cubic root of 102099967 is about 467.3854630902.
It can be divided in two parts, 1020 and 99967, that multiplied together give a triangular number (101966340 = T14280).
The spelling of 102099967 in words is "one hundred two million, ninety-nine thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.059 sec. • engine limits •