Base | Representation |
---|---|
bin | 101111111110001111… |
… | …0001110110100100001 |
3 | 100211220122100211022112 |
4 | 1133330132032310201 |
5 | 3141441112000030 |
6 | 115154324445105 |
7 | 10304634550244 |
oct | 1377436166441 |
9 | 324818324275 |
10 | 103020031265 |
11 | 3a766138308 |
12 | 17b71249795 |
13 | 993a3b86a8 |
14 | 4db419d25b |
15 | 2a2e438a95 |
hex | 17fc78ed21 |
103020031265 has 24 divisors (see below), whose sum is σ = 129490862184. Its totient is φ = 78664608000.
The previous prime is 103020031243. The next prime is 103020031333. The reversal of 103020031265 is 562130020301.
It can be written as a sum of positive squares in 4 ways, for example, as 691058944 + 102328972321 = 26288^2 + 319889^2 .
It is not a de Polignac number, because 103020031265 - 216 = 103019965729 is a prime.
It is a super-2 number, since 2×1030200312652 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 103020031265.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 203915 + ... + 497615.
It is an arithmetic number, because the mean of its divisors is an integer number (5395452591).
Almost surely, 2103020031265 is an apocalyptic number.
It is an amenable number.
103020031265 is a deficient number, since it is larger than the sum of its proper divisors (26470830919).
103020031265 is an equidigital number, since it uses as much as digits as its factorization.
103020031265 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 293841 (or 293810 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 103020031265 its reverse (562130020301), we get a palindrome (665150051566).
The spelling of 103020031265 in words is "one hundred three billion, twenty million, thirty-one thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •