Base | Representation |
---|---|
bin | 101111111110001111… |
… | …0101100110111010101 |
3 | 100211220122121002010022 |
4 | 1133330132230313111 |
5 | 3141441124414300 |
6 | 115154331234525 |
7 | 10304635602104 |
oct | 1377436546725 |
9 | 324818532108 |
10 | 103020154325 |
11 | 3a766211810 |
12 | 17b712a8a45 |
13 | 993a42c6ca |
14 | 4db41d203b |
15 | 2a2e460285 |
hex | 17fc7acdd5 |
103020154325 has 12 divisors (see below), whose sum is σ = 139358172768. Its totient is φ = 74923748400.
The previous prime is 103020154301. The next prime is 103020154387. The reversal of 103020154325 is 523451020301.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-103020154325 is a prime.
It is a super-3 number, since 3×1030201543253 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 103020154294 and 103020154303.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 187309097 + ... + 187309646.
It is an arithmetic number, because the mean of its divisors is an integer number (11613181064).
Almost surely, 2103020154325 is an apocalyptic number.
It is an amenable number.
103020154325 is a deficient number, since it is larger than the sum of its proper divisors (36338018443).
103020154325 is a wasteful number, since it uses less digits than its factorization.
103020154325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374618764 (or 374618759 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 103020154325 its reverse (523451020301), we get a palindrome (626471174626).
The spelling of 103020154325 in words is "one hundred three billion, twenty million, one hundred fifty-four thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •