Base | Representation |
---|---|
bin | 110000000011101110… |
… | …0111111011011000001 |
3 | 100212101111000101100120 |
4 | 1200013130333123001 |
5 | 3142330242133200 |
6 | 115224505210453 |
7 | 10312332461025 |
oct | 1400734773301 |
9 | 325344011316 |
10 | 103204255425 |
11 | 3a850125687 |
12 | 18002a90a29 |
13 | 996960b17b |
14 | 4dd0836385 |
15 | 2a406c89a0 |
hex | 180773f6c1 |
103204255425 has 24 divisors (see below), whose sum is σ = 171339078240. Its totient is φ = 54813868800.
The previous prime is 103204255417. The next prime is 103204255447. The reversal of 103204255425 is 524552402301.
It is a happy number.
It is not a de Polignac number, because 103204255425 - 23 = 103204255417 is a prime.
It is a super-2 number, since 2×1032042554252 (a number of 23 digits) contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 2836815 + ... + 2872964.
It is an arithmetic number, because the mean of its divisors is an integer number (7139128260).
Almost surely, 2103204255425 is an apocalyptic number.
103204255425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
103204255425 is a deficient number, since it is larger than the sum of its proper divisors (68134822815).
103204255425 is a wasteful number, since it uses less digits than its factorization.
103204255425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5710033 (or 5710028 counting only the distinct ones).
The product of its (nonzero) digits is 48000, while the sum is 33.
Adding to 103204255425 its reverse (524552402301), we get a palindrome (627756657726).
The spelling of 103204255425 in words is "one hundred three billion, two hundred four million, two hundred fifty-five thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •