Base | Representation |
---|---|
bin | 110000000111110101… |
… | …0111100100011101001 |
3 | 100212202002110012200101 |
4 | 1200033222330203221 |
5 | 3143121041201213 |
6 | 115250312305401 |
7 | 10315625423632 |
oct | 1401752744351 |
9 | 325662405611 |
10 | 103342131433 |
11 | 3a910a369a2 |
12 | 180410a2261 |
13 | 998c0537c8 |
14 | 5004c86889 |
15 | 2a4c860bdd |
hex | 180fabc8e9 |
103342131433 has 8 divisors (see below), whose sum is σ = 106992304640. Its totient is φ = 99711743040.
The previous prime is 103342131379. The next prime is 103342131437. The reversal of 103342131433 is 334131243301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103342131433 - 229 = 102805260521 is a prime.
It is a super-2 number, since 2×1033421314332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103342131437) 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 7 ways as a sum of consecutive naturals, for example, 4935573 + ... + 4956466.
It is an arithmetic number, because the mean of its divisors is an integer number (13374038080).
Almost surely, 2103342131433 is an apocalyptic number.
It is an amenable number.
103342131433 is a deficient number, since it is larger than the sum of its proper divisors (3650173207).
103342131433 is an equidigital number, since it uses as much as digits as its factorization.
103342131433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9892407.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 103342131433 its reverse (334131243301), we get a palindrome (437473374734).
The spelling of 103342131433 in words is "one hundred three billion, three hundred forty-two million, one hundred thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •