Base | Representation |
---|---|
bin | 101111101001001011… |
… | …0010010000101101111 |
3 | 100210002101112101100121 |
4 | 1133102112102011233 |
5 | 3134014201220211 |
6 | 115000241105411 |
7 | 10251263511202 |
oct | 1372226220557 |
9 | 323071471317 |
10 | 102313304431 |
11 | 3a433213a48 |
12 | 179b4628267 |
13 | 9856b62530 |
14 | 4d48393939 |
15 | 29dc388271 |
hex | 17d259216f |
102313304431 has 4 divisors (see below), whose sum is σ = 110183558632. Its totient is φ = 94443050232.
The previous prime is 102313304419. The next prime is 102313304479. The reversal of 102313304431 is 134403313201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102313304431 - 221 = 102311207279 is a prime.
It is a super-2 number, since 2×1023133044312 (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 = 102313304396 and 102313304405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102313304131) 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, 3935127081 + ... + 3935127106.
It is an arithmetic number, because the mean of its divisors is an integer number (27545889658).
Almost surely, 2102313304431 is an apocalyptic number.
102313304431 is a deficient number, since it is larger than the sum of its proper divisors (7870254201).
102313304431 is an equidigital number, since it uses as much as digits as its factorization.
102313304431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7870254200.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 102313304431 its reverse (134403313201), we get a palindrome (236716617632).
The spelling of 102313304431 in words is "one hundred two billion, three hundred thirteen million, three hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •