Base | Representation |
---|---|
bin | 101111100010100011… |
… | …1001011001100100111 |
3 | 100202111220200100112121 |
4 | 1133011013023030213 |
5 | 3133040324141411 |
6 | 114522225330411 |
7 | 10242626136541 |
oct | 1370507131447 |
9 | 322456610477 |
10 | 102091240231 |
11 | 3a329930912 |
12 | 17952196a07 |
13 | 981cb513b6 |
14 | 4d26aaa691 |
15 | 29c7b21571 |
hex | 17c51cb327 |
102091240231 has 4 divisors (see below), whose sum is σ = 102439674792. Its totient is φ = 101742805672.
The previous prime is 102091240219. The next prime is 102091240297. The reversal of 102091240231 is 132042190201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132042190201 = 2713 ⋅48670177.
It is a cyclic number.
It is not a de Polignac number, because 102091240231 - 213 = 102091232039 is a prime.
It is a super-2 number, since 2×1020912402312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102091240196 and 102091240205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102091243231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 174216841 + ... + 174217426.
It is an arithmetic number, because the mean of its divisors is an integer number (25609918698).
Almost surely, 2102091240231 is an apocalyptic number.
102091240231 is a deficient number, since it is larger than the sum of its proper divisors (348434561).
102091240231 is an equidigital number, since it uses as much as digits as its factorization.
102091240231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 348434560.
The product of its (nonzero) digits is 864, while the sum is 25.
The spelling of 102091240231 in words is "one hundred two billion, ninety-one million, two hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •