Base | Representation |
---|---|
bin | 110000000100111010… |
… | …1111010000010011011 |
3 | 100212111021102221222102 |
4 | 1200021311322002123 |
5 | 3142421022411103 |
6 | 115232500314015 |
7 | 10313330264540 |
oct | 1401165720233 |
9 | 325437387872 |
10 | 103244341403 |
11 | 3a870814895 |
12 | 180143a290b |
13 | 9974a04b98 |
14 | 4dd5cacbc7 |
15 | 2a43e95e88 |
hex | 1809d7a09b |
103244341403 has 4 divisors (see below), whose sum is σ = 117993533040. Its totient is φ = 88495149768.
The previous prime is 103244341397. The next prime is 103244341423. The reversal of 103244341403 is 304143442301.
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: 304143442301 = 8231 ⋅36950971.
It is a cyclic number.
It is not a de Polignac number, because 103244341403 - 216 = 103244275867 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103244341423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7374595808 + ... + 7374595821.
It is an arithmetic number, because the mean of its divisors is an integer number (29498383260).
Almost surely, 2103244341403 is an apocalyptic number.
103244341403 is a deficient number, since it is larger than the sum of its proper divisors (14749191637).
103244341403 is an equidigital number, since it uses as much as digits as its factorization.
103244341403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14749191636.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 103244341403 its reverse (304143442301), we get a palindrome (407387783704).
The spelling of 103244341403 in words is "one hundred three billion, two hundred forty-four million, three hundred forty-one thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •