Base | Representation |
---|---|
bin | 1100001010010… |
… | …11000010001011 |
3 | 21002222010001022 |
4 | 12011023002023 |
5 | 202104103321 |
6 | 14042343055 |
7 | 2346102050 |
oct | 605130213 |
9 | 232863038 |
10 | 102019211 |
11 | 526505a8 |
12 | 2a1baa8b |
13 | 1819c8c8 |
14 | d799027 |
15 | 8e52dab |
hex | 614b08b |
102019211 has 4 divisors (see below), whose sum is σ = 116593392. Its totient is φ = 87445032.
The previous prime is 102019207. The next prime is 102019213. The reversal of 102019211 is 112910201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 112910201 = 2333 ⋅48397.
It is a cyclic number.
It is not a de Polignac number, because 102019211 - 22 = 102019207 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 102019211.
It is not an unprimeable number, because it can be changed into a prime (102019213) 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 3 ways as a sum of consecutive naturals, for example, 7287080 + ... + 7287093.
It is an arithmetic number, because the mean of its divisors is an integer number (29148348).
Almost surely, 2102019211 is an apocalyptic number.
102019211 is a deficient number, since it is larger than the sum of its proper divisors (14574181).
102019211 is an equidigital number, since it uses as much as digits as its factorization.
102019211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14574180.
The product of its (nonzero) digits is 36, while the sum is 17.
The square root of 102019211 is about 10100.4559798061. The cubic root of 102019211 is about 467.2622043625.
Adding to 102019211 its reverse (112910201), we get a palindrome (214929412).
The spelling of 102019211 in words is "one hundred two million, nineteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •