Base | Representation |
---|---|
bin | 110000000100100010… |
… | …0101101100011010000 |
3 | 100212110101011202201021 |
4 | 1200021010231203100 |
5 | 3142404222221300 |
6 | 115231320045224 |
7 | 10313112543352 |
oct | 1401104554320 |
9 | 325411152637 |
10 | 103231445200 |
11 | 3a864506774 |
12 | 18010003814 |
13 | 997213acb0 |
14 | 4dd42b30d2 |
15 | 2a42c99d1a |
hex | 180912d8d0 |
103231445200 has 60 divisors (see below), whose sum is σ = 267091525708. Its totient is φ = 38116224000.
The previous prime is 103231445197. The next prime is 103231445237. The reversal of 103231445200 is 2544132301.
It can be written as a sum of positive squares in 6 ways, for example, as 39588265024 + 63643180176 = 198968^2 + 252276^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9920901 + ... + 9931300.
Almost surely, 2103231445200 is an apocalyptic number.
103231445200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103231445200 is an abundant number, since it is smaller than the sum of its proper divisors (163860080508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103231445200 is a wasteful number, since it uses less digits than its factorization.
103231445200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19852232 (or 19852221 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 103231445200 its reverse (2544132301), we get a palindrome (105775577501).
The spelling of 103231445200 in words is "one hundred three billion, two hundred thirty-one million, four hundred forty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •