Base | Representation |
---|---|
bin | 110000001110000111… |
… | …1111000011011010011 |
3 | 100220021210111120121121 |
4 | 1200130033320123103 |
5 | 3144034100443220 |
6 | 115323251103111 |
7 | 10324100112343 |
oct | 1403417703323 |
9 | 326253446547 |
10 | 103553140435 |
11 | 3aa0a0590a8 |
12 | 1809b8a1a97 |
13 | 99c39939c4 |
14 | 5024cd2d23 |
15 | 2a61141eaa |
hex | 181c3f86d3 |
103553140435 has 8 divisors (see below), whose sum is σ = 128272277376. Its totient is φ = 80170173120.
The previous prime is 103553140409. The next prime is 103553140459. The reversal of 103553140435 is 534041355301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 103553140435 - 27 = 103553140307 is a prime.
It is a super-3 number, since 3×1035531404353 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103553140435.
It is an unprimeable number.
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, 334042234 + ... + 334042543.
It is an arithmetic number, because the mean of its divisors is an integer number (16034034672).
Almost surely, 2103553140435 is an apocalyptic number.
103553140435 is a deficient number, since it is larger than the sum of its proper divisors (24719136941).
103553140435 is an equidigital number, since it uses as much as digits as its factorization.
103553140435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668084813.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 103553140435 its reverse (534041355301), we get a palindrome (637594495736).
The spelling of 103553140435 in words is "one hundred three billion, five hundred fifty-three million, one hundred forty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •