Base | Representation |
---|---|
bin | 101111100011000010… |
… | …1101001000010010101 |
3 | 100202120001111022000122 |
4 | 1133012011221002111 |
5 | 3133104022143011 |
6 | 114524012321325 |
7 | 10243215260522 |
oct | 1370605510225 |
9 | 322501438018 |
10 | 102107615381 |
11 | 3a3380a57a2 |
12 | 17957773245 |
13 | 9823365935 |
14 | 4d28d30149 |
15 | 29c92a83db |
hex | 17c6169095 |
102107615381 has 4 divisors (see below), whose sum is σ = 102340207200. Its totient is φ = 101875023564.
The previous prime is 102107615377. The next prime is 102107615411. The reversal of 102107615381 is 183516701201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102107615381 - 22 = 102107615377 is a prime.
It is a super-2 number, since 2×1021076153812 (a number of 23 digits) 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 (102107615371) 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, 116295251 + ... + 116296128.
It is an arithmetic number, because the mean of its divisors is an integer number (25585051800).
Almost surely, 2102107615381 is an apocalyptic number.
It is an amenable number.
102107615381 is a deficient number, since it is larger than the sum of its proper divisors (232591819).
102107615381 is an equidigital number, since it uses as much as digits as its factorization.
102107615381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232591818.
The product of its (nonzero) digits is 10080, while the sum is 35.
The spelling of 102107615381 in words is "one hundred two billion, one hundred seven million, six hundred fifteen thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •