Base | Representation |
---|---|
bin | 101111101100101011… |
… | …1110000101011110011 |
3 | 100210101121020122221120 |
4 | 1133121113300223303 |
5 | 3134234332214103 |
6 | 115020050353323 |
7 | 10254224155035 |
oct | 1373127605363 |
9 | 323347218846 |
10 | 102431132403 |
11 | 3a493781936 |
12 | 17a27b8b843 |
13 | 98753a8922 |
14 | 4d59ca5c55 |
15 | 29e78b0253 |
hex | 17d95f0af3 |
102431132403 has 4 divisors (see below), whose sum is σ = 136574843208. Its totient is φ = 68287421600.
The previous prime is 102431132399. The next prime is 102431132413. The reversal of 102431132403 is 304231134201.
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: 304231134201 = 3 ⋅101410378067.
It is a cyclic number.
It is not a de Polignac number, because 102431132403 - 22 = 102431132399 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102431132413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17071855398 + ... + 17071855403.
It is an arithmetic number, because the mean of its divisors is an integer number (34143710802).
Almost surely, 2102431132403 is an apocalyptic number.
102431132403 is a deficient number, since it is larger than the sum of its proper divisors (34143710805).
102431132403 is an equidigital number, since it uses as much as digits as its factorization.
102431132403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34143710804.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 102431132403 its reverse (304231134201), we get a palindrome (406662266604).
The spelling of 102431132403 in words is "one hundred two billion, four hundred thirty-one million, one hundred thirty-two thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •