Base | Representation |
---|---|
bin | 110000001101001010… |
… | …1011101111001111000 |
3 | 100220012120010020010120 |
4 | 1200122111131321320 |
5 | 3144002342101412 |
6 | 115320143213240 |
7 | 10323230260035 |
oct | 1403225357170 |
9 | 326176106116 |
10 | 103521050232 |
11 | 3a9a2a30276 |
12 | 18090ba7220 |
13 | 99ba139512 |
14 | 502093c38c |
15 | 2a5d403b8c |
hex | 181a55de78 |
103521050232 has 48 divisors (see below), whose sum is σ = 273140744040. Its totient is φ = 32690855232.
The previous prime is 103521050209. The next prime is 103521050291. The reversal of 103521050232 is 232050125301.
It is a happy number.
It is a super-2 number, since 2×1035210502322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5965543 + ... + 5982870.
Almost surely, 2103521050232 is an apocalyptic number.
103521050232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103521050232 is an abundant number, since it is smaller than the sum of its proper divisors (169619693808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103521050232 is a wasteful number, since it uses less digits than its factorization.
103521050232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11948460 (or 11948437 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 24.
Adding to 103521050232 its reverse (232050125301), we get a palindrome (335571175533).
The spelling of 103521050232 in words is "one hundred three billion, five hundred twenty-one million, fifty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •