Base | Representation |
---|---|
bin | 1100001010100… |
… | …10010101011111 |
3 | 21010000122002000 |
4 | 12011102111133 |
5 | 202111032434 |
6 | 14043133343 |
7 | 2346255204 |
oct | 605222537 |
9 | 233018060 |
10 | 102049119 |
11 | 52671017 |
12 | 2a214253 |
13 | 181b03c3 |
14 | d7a5cab |
15 | 8e5bb99 |
hex | 615255f |
102049119 has 16 divisors (see below), whose sum is σ = 153100800. Its totient is φ = 67170168.
The previous prime is 102049111. The next prime is 102049127. The reversal of 102049119 is 911940201.
It is an interprime number because it is at equal distance from previous prime (102049111) and next prime (102049127).
It is not a de Polignac number, because 102049119 - 23 = 102049111 is a prime.
It is a super-2 number, since 2×1020491192 = 20828045377352322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 102049092 and 102049101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102049111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21789 + ... + 26054.
It is an arithmetic number, because the mean of its divisors is an integer number (9568800).
Almost surely, 2102049119 is an apocalyptic number.
102049119 is a deficient number, since it is larger than the sum of its proper divisors (51051681).
102049119 is an equidigital number, since it uses as much as digits as its factorization.
102049119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47931 (or 47925 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The square root of 102049119 is about 10101.9363985327. The cubic root of 102049119 is about 467.3078608373.
The spelling of 102049119 in words is "one hundred two million, forty-nine thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •