Base | Representation |
---|---|
bin | 10111011101110100100000… |
… | …110101110110101100000110 |
3 | 111112102020101111222112212112 |
4 | 113131310200311312230012 |
5 | 102011344421424103014 |
6 | 1003255224332021022 |
7 | 30511160156025626 |
oct | 2735644065665406 |
9 | 445366344875775 |
10 | 103204320144134 |
11 | 2a97a785210300 |
12 | b6a9832001772 |
13 | 4578183018401 |
14 | 1b6b189878886 |
15 | bde8ab89a73e |
hex | 5ddd20d76b06 |
103204320144134 has 24 divisors (see below), whose sum is σ = 170226208203240. Its totient is φ = 46892578138560.
The previous prime is 103204320144119. The next prime is 103204320144137. The reversal of 103204320144134 is 431441023402301.
It is a super-2 number, since 2×1032043201441342 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103204320144134.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103204320144137) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 83368259 + ... + 84597134.
It is an arithmetic number, because the mean of its divisors is an integer number (7092758675135).
Almost surely, 2103204320144134 is an apocalyptic number.
103204320144134 is a deficient number, since it is larger than the sum of its proper divisors (67021888059106).
103204320144134 is a wasteful number, since it uses less digits than its factorization.
103204320144134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167967956 (or 167967945 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 103204320144134 its reverse (431441023402301), we get a palindrome (534645343546435).
The spelling of 103204320144134 in words is "one hundred three trillion, two hundred four billion, three hundred twenty million, one hundred forty-four thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •