Base | Representation |
---|---|
bin | 110000010000110010… |
… | …1010011101101110010 |
3 | 100220112000220210111001 |
4 | 1200201211103231302 |
5 | 3144230004041224 |
6 | 115340205312214 |
7 | 10326234634600 |
oct | 1404145235562 |
9 | 326460823431 |
10 | 103642643314 |
11 | 3aa5562aa21 |
12 | 1810586566a |
13 | 9a093a05a2 |
14 | 5032b50870 |
15 | 2a68e21544 |
hex | 1821953b72 |
103642643314 has 24 divisors (see below), whose sum is σ = 185733568620. Its totient is φ = 43217780256.
The previous prime is 103642643233. The next prime is 103642643327. The reversal of 103642643314 is 413346246301.
It can be written as a sum of positive squares in 2 ways, for example, as 72513334089 + 31129309225 = 269283^2 + 176435^2 .
It is a super-3 number, since 3×1036426433143 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 14287969 + ... + 14295220.
Almost surely, 2103642643314 is an apocalyptic number.
103642643314 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
103642643314 is a deficient number, since it is larger than the sum of its proper divisors (82090925306).
103642643314 is a wasteful number, since it uses less digits than its factorization.
103642643314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28583242 (or 28583235 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 37.
Adding to 103642643314 its reverse (413346246301), we get a palindrome (516988889615).
The spelling of 103642643314 in words is "one hundred three billion, six hundred forty-two million, six hundred forty-three thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •