Base | Representation |
---|---|
bin | 101111101100101100… |
… | …0011101000101000011 |
3 | 100210101121120220101101 |
4 | 1133121120131011003 |
5 | 3134234404023433 |
6 | 115020054315231 |
7 | 10254225543136 |
oct | 1373130350503 |
9 | 323347526341 |
10 | 102431314243 |
11 | 3a493896515 |
12 | 17a28058b17 |
13 | 987544061b |
14 | 4d59d1221d |
15 | 29e78e907d |
hex | 17d961d143 |
102431314243 has 4 divisors (see below), whose sum is σ = 102501812128. Its totient is φ = 102360816360.
The previous prime is 102431314169. The next prime is 102431314261. The reversal of 102431314243 is 342413134201.
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: 342413134201 = 120077 ⋅2851613.
It is a cyclic number.
It is not a de Polignac number, because 102431314243 - 213 = 102431306051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102431314283) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35246763 + ... + 35249668.
It is an arithmetic number, because the mean of its divisors is an integer number (25625453032).
Almost surely, 2102431314243 is an apocalyptic number.
102431314243 is a deficient number, since it is larger than the sum of its proper divisors (70497885).
102431314243 is an equidigital number, since it uses as much as digits as its factorization.
102431314243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70497884.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 102431314243 its reverse (342413134201), we get a palindrome (444844448444).
The spelling of 102431314243 in words is "one hundred two billion, four hundred thirty-one million, three hundred fourteen thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •