Base | Representation |
---|---|
bin | 101111101100101100… |
… | …0111100110110111101 |
3 | 100210101121211111221111 |
4 | 1133121120330312331 |
5 | 3134234422210123 |
6 | 115020101202021 |
7 | 10254226624504 |
oct | 1373130746675 |
9 | 323347744844 |
10 | 102431444413 |
11 | 3a4939752a1 |
12 | 17a28100311 |
13 | 987548794c |
14 | 4d59d4783b |
15 | 29e792290d |
hex | 17d963cdbd |
102431444413 has 4 divisors (see below), whose sum is σ = 103213363968. Its totient is φ = 101649524860.
The previous prime is 102431444363. The next prime is 102431444447. The reversal of 102431444413 is 314444134201.
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, and also an emirpimes, since its reverse is a distinct semiprime: 314444134201 = 421 ⋅746898181.
It is a cyclic number.
It is not a de Polignac number, because 102431444413 - 213 = 102431436221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102431444113) 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, 390959581 + ... + 390959842.
It is an arithmetic number, because the mean of its divisors is an integer number (25803340992).
Almost surely, 2102431444413 is an apocalyptic number.
It is an amenable number.
102431444413 is a deficient number, since it is larger than the sum of its proper divisors (781919555).
102431444413 is an equidigital number, since it uses as much as digits as its factorization.
102431444413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 781919554.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 102431444413 its reverse (314444134201), we get a palindrome (416875578614).
The spelling of 102431444413 in words is "one hundred two billion, four hundred thirty-one million, four hundred forty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •