Base | Representation |
---|---|
bin | 110000000101001011… |
… | …1001011110110101101 |
3 | 100212111212212011200112 |
4 | 1200022113023312231 |
5 | 3142430241041013 |
6 | 115233411305405 |
7 | 10313464400261 |
oct | 1401227136655 |
9 | 325455764615 |
10 | 103253065133 |
11 | 3a875733089 |
12 | 180172ab265 |
13 | 997676a85a |
14 | 4dd71000a1 |
15 | 2a44b1aba8 |
hex | 180a5cbdad |
103253065133 has 16 divisors (see below), whose sum is σ = 105886682496. Its totient is φ = 100654202880.
The previous prime is 103253065103. The next prime is 103253065141. The reversal of 103253065133 is 331560352301.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103253065133 is a prime.
It is a super-2 number, since 2×1032530651332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103253065133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103253065103) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 7934210 + ... + 7947212.
It is an arithmetic number, because the mean of its divisors is an integer number (6617917656).
Almost surely, 2103253065133 is an apocalyptic number.
It is an amenable number.
103253065133 is a deficient number, since it is larger than the sum of its proper divisors (2633617363).
103253065133 is a wasteful number, since it uses less digits than its factorization.
103253065133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14324.
The product of its (nonzero) digits is 24300, while the sum is 32.
The spelling of 103253065133 in words is "one hundred three billion, two hundred fifty-three million, sixty-five thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •