Base | Representation |
---|---|
bin | 101111100110110000… |
… | …1110010110101100111 |
3 | 100202212202100211211011 |
4 | 1133031201302311213 |
5 | 3133333000423241 |
6 | 114544231523051 |
7 | 10246262240323 |
oct | 1371541626547 |
9 | 322782324734 |
10 | 102232436071 |
11 | 3a3a15aa397 |
12 | 17991529487 |
13 | 9843189b2c |
14 | 4d3b742983 |
15 | 29d5212281 |
hex | 17cd872d67 |
102232436071 has 4 divisors (see below), whose sum is σ = 102237082200. Its totient is φ = 102227789944.
The previous prime is 102232436039. The next prime is 102232436077. The reversal of 102232436071 is 170634232201.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 170634232201 = 31 ⋅5504330071.
It is a cyclic number.
It is not a de Polignac number, because 102232436071 - 25 = 102232436039 is a prime.
It is a super-2 number, since 2×1022324360712 (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 (102232436077) 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, 2289901 + ... + 2334118.
It is an arithmetic number, because the mean of its divisors is an integer number (25559270550).
Almost surely, 2102232436071 is an apocalyptic number.
102232436071 is a deficient number, since it is larger than the sum of its proper divisors (4646129).
102232436071 is an equidigital number, since it uses as much as digits as its factorization.
102232436071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4646128.
The product of its (nonzero) digits is 12096, while the sum is 31.
Adding to 102232436071 its reverse (170634232201), we get a palindrome (272866668272).
The spelling of 102232436071 in words is "one hundred two billion, two hundred thirty-two million, four hundred thirty-six thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •