Base | Representation |
---|---|
bin | 10111011010111111111100… |
… | …101100010101110111101010 |
3 | 111111201200221200112222121101 |
4 | 113122333330230111313222 |
5 | 102000210340134023224 |
6 | 1003030202022432014 |
7 | 30461154510143125 |
oct | 2732777454256752 |
9 | 444650850488541 |
10 | 103010440142314 |
11 | 2a905533a90341 |
12 | b678143b9260a |
13 | 4562ac58bb143 |
14 | 1b61a364c13bc |
15 | bd9810864044 |
hex | 5daffcb15dea |
103010440142314 has 8 divisors (see below), whose sum is σ = 154515738972708. Its totient is φ = 51505193818080.
The previous prime is 103010440142213. The next prime is 103010440142317. The reversal of 103010440142314 is 413241044010301.
It can be written as a sum of positive squares in 2 ways, for example, as 89791638464025 + 13218801678289 = 9475845^2 + 3635767^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1030104401423142 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103010440142317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7787547 + ... + 16329934.
Almost surely, 2103010440142314 is an apocalyptic number.
103010440142314 is a deficient number, since it is larger than the sum of its proper divisors (51505298830394).
103010440142314 is a wasteful number, since it uses less digits than its factorization.
103010440142314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26253080.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 103010440142314 its reverse (413241044010301), we get a palindrome (516251484152615).
The spelling of 103010440142314 in words is "one hundred three trillion, ten billion, four hundred forty million, one hundred forty-two thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •