Base | Representation |
---|---|
bin | 110000000111010011… |
… | …0010111000101001101 |
3 | 100212200211121202201200 |
4 | 1200032212113011031 |
5 | 3143101440332031 |
6 | 115244431100113 |
7 | 10315316542110 |
oct | 1401646270515 |
9 | 325624552650 |
10 | 103324152141 |
11 | 3a901876881 |
12 | 18037071639 |
13 | 99883ca082 |
14 | 5002726577 |
15 | 2a4aead8e6 |
hex | 180e99714d |
103324152141 has 12 divisors (see below), whose sum is σ = 170566854432. Its totient is φ = 59042372616.
The previous prime is 103324152131. The next prime is 103324152209. The reversal of 103324152141 is 141251423301.
103324152141 is a `hidden beast` number, since 1 + 0 + 3 + 32 + 415 + 214 + 1 = 666.
It is not a de Polignac number, because 103324152141 - 219 = 103323627853 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103324152121) by changing a digit.
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, 820032891 + ... + 820033016.
It is an arithmetic number, because the mean of its divisors is an integer number (14213904536).
Almost surely, 2103324152141 is an apocalyptic number.
It is an amenable number.
103324152141 is a deficient number, since it is larger than the sum of its proper divisors (67242702291).
103324152141 is a wasteful number, since it uses less digits than its factorization.
103324152141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1640065920 (or 1640065917 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 103324152141 its reverse (141251423301), we get a palindrome (244575575442).
The spelling of 103324152141 in words is "one hundred three billion, three hundred twenty-four million, one hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •