Base | Representation |
---|---|
bin | 101111111110000010… |
… | …0100011110011000010 |
3 | 100211220011200220201211 |
4 | 1133330010203303002 |
5 | 3141432401121232 |
6 | 115153524320334 |
7 | 10304523420622 |
oct | 1377404436302 |
9 | 324804626654 |
10 | 103013301442 |
11 | 3a762361077 |
12 | 17b6ab430aa |
13 | 9938ba044c |
14 | 4db332a882 |
15 | 2a2da59a47 |
hex | 17fc123cc2 |
103013301442 has 8 divisors (see below), whose sum is σ = 154537664076. Its totient is φ = 51500746752.
The previous prime is 103013301409. The next prime is 103013301449. The reversal of 103013301442 is 244103310301.
103013301442 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 92295047601 + 10718253841 = 303801^2 + 103529^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1030133014422 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103013301449) 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 3 ways as a sum of consecutive naturals, for example, 2930143 + ... + 2965090.
Almost surely, 2103013301442 is an apocalyptic number.
103013301442 is a deficient number, since it is larger than the sum of its proper divisors (51524362634).
103013301442 is an equidigital number, since it uses as much as digits as its factorization.
103013301442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5903972.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 103013301442 its reverse (244103310301), we get a palindrome (347116611743).
The spelling of 103013301442 in words is "one hundred three billion, thirteen million, three hundred one thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •