Base | Representation |
---|---|
bin | 101111101001101101… |
… | …1011011100100100011 |
3 | 100210010122122022121112 |
4 | 1133103123123210203 |
5 | 3134033321244303 |
6 | 115002125413535 |
7 | 10251603546011 |
oct | 1372333334443 |
9 | 323118568545 |
10 | 102331431203 |
11 | 3a442474951 |
12 | 179ba70a2ab |
13 | 985a83b131 |
14 | 4d4a9518b1 |
15 | 29ddc690d8 |
hex | 17d36db923 |
102331431203 has 4 divisors (see below), whose sum is σ = 106780623888. Its totient is φ = 97882238520.
The previous prime is 102331431197. The next prime is 102331431287. The reversal of 102331431203 is 302134133201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102331431203 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23), and also a Moran number because the ratio is a prime number: 4449192661 = 102331431203 / (1 + 0 + 2 + 3 + 3 + 1 + 4 + 3 + 1 + 2 + 0 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102331431403) 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, 2224596308 + ... + 2224596353.
It is an arithmetic number, because the mean of its divisors is an integer number (26695155972).
Almost surely, 2102331431203 is an apocalyptic number.
102331431203 is a deficient number, since it is larger than the sum of its proper divisors (4449192685).
102331431203 is an equidigital number, since it uses as much as digits as its factorization.
102331431203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4449192684.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 102331431203 its reverse (302134133201), we get a palindrome (404465564404).
The spelling of 102331431203 in words is "one hundred two billion, three hundred thirty-one million, four hundred thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •