Base | Representation |
---|---|
bin | 110000000100011000… |
… | …0110100101011010000 |
3 | 100212110000100212212102 |
4 | 1200020300310223100 |
5 | 3142401403402004 |
6 | 115231012215532 |
7 | 10313020330154 |
oct | 1401060645320 |
9 | 325400325772 |
10 | 103226231504 |
11 | 3a861575630 |
12 | 1800a30a5a8 |
13 | 9971033b76 |
14 | 4dd3717064 |
15 | 2a425ba11e |
hex | 1808c34ad0 |
103226231504 has 20 divisors (see below), whose sum is σ = 218182716960. Its totient is φ = 46921014240.
The previous prime is 103226231489. The next prime is 103226231509. The reversal of 103226231504 is 405132622301.
It is a happy number.
It is a super-3 number, since 3×1032262315043 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103226231509) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 293256164 + ... + 293256515.
It is an arithmetic number, because the mean of its divisors is an integer number (10909135848).
Almost surely, 2103226231504 is an apocalyptic number.
It is an amenable number.
103226231504 is an abundant number, since it is smaller than the sum of its proper divisors (114956485456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103226231504 is a wasteful number, since it uses less digits than its factorization.
103226231504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586512698 (or 586512692 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 103226231504 its reverse (405132622301), we get a palindrome (508358853805).
The spelling of 103226231504 in words is "one hundred three billion, two hundred twenty-six million, two hundred thirty-one thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •