Base | Representation |
---|---|
bin | 10111011111100100000110… |
… | …101110001001110111011100 |
3 | 111112211200200001001210211200 |
4 | 113133210012232021313130 |
5 | 102020330320044032304 |
6 | 1003430242144515500 |
7 | 30522631351355433 |
oct | 2737440656116734 |
9 | 445750601053750 |
10 | 103324141002204 |
11 | 2aa16581a39441 |
12 | b708ab191bb90 |
13 | 458656a06c325 |
14 | 1b72cb50ac11a |
15 | be2a70c66e39 |
hex | 5df906b89ddc |
103324141002204 has 36 divisors (see below), whose sum is σ = 265607255124120. Its totient is φ = 33857628124320.
The previous prime is 103324141002119. The next prime is 103324141002319. The reversal of 103324141002204 is 402200141423301.
103324141002204 is a `hidden beast` number, since 1 + 0 + 3 + 3 + 2 + 41 + 410 + 0 + 2 + 204 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×1033241410022042 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24323006587 + ... + 24323010834.
Almost surely, 2103324141002204 is an apocalyptic number.
It is an amenable number.
103324141002204 is an abundant number, since it is smaller than the sum of its proper divisors (162283114121916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103324141002204 is a wasteful number, since it uses less digits than its factorization.
103324141002204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48646017490 (or 48646017485 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 103324141002204 its reverse (402200141423301), we get a palindrome (505524282425505).
The spelling of 103324141002204 in words is "one hundred three trillion, three hundred twenty-four billion, one hundred forty-one million, two thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •