Base | Representation |
---|---|
bin | 10111011100111100010110… |
… | …001110001111001010101010 |
3 | 111112012110201120101222100021 |
4 | 113130330112032033022222 |
5 | 102004402414141204310 |
6 | 1003211412152431054 |
7 | 30503623532032144 |
oct | 2734742616171252 |
9 | 445173646358307 |
10 | 103144012444330 |
11 | 2a95714807a890 |
12 | b69a0010a848a |
13 | 45725918c5840 |
14 | 1b682a81a9c94 |
15 | bdd02c1175da |
hex | 5dcf1638f2aa |
103144012444330 has 64 divisors (see below), whose sum is σ = 218122132894848. Its totient is φ = 34620972053760.
The previous prime is 103144012444321. The next prime is 103144012444331. The reversal of 103144012444330 is 33444210441301.
It is a super-2 number, since 2×1031440124443302 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103144012444331) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63254649 + ... + 64864771.
It is an arithmetic number, because the mean of its divisors is an integer number (3408158326482).
Almost surely, 2103144012444330 is an apocalyptic number.
103144012444330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103144012444330 is an abundant number, since it is smaller than the sum of its proper divisors (114978120450518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103144012444330 is a wasteful number, since it uses less digits than its factorization.
103144012444330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1654951.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 103144012444330 its reverse (33444210441301), we get a palindrome (136588222885631).
The spelling of 103144012444330 in words is "one hundred three trillion, one hundred forty-four billion, twelve million, four hundred forty-four thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •