Base | Representation |
---|---|
bin | 101111111110000001… |
… | …1100010010000110101 |
3 | 100211220011012021112000 |
4 | 1133330003202100311 |
5 | 3141432314024023 |
6 | 115153514445513 |
7 | 10304521222212 |
oct | 1377403422065 |
9 | 324804167460 |
10 | 103013033013 |
11 | 3a762198430 |
12 | 17b6aa33899 |
13 | 9938b08207 |
14 | 4db329ab09 |
15 | 2a2da05243 |
hex | 17fc0e2435 |
103013033013 has 32 divisors (see below), whose sum is σ = 167701000320. Its totient is φ = 61976407680.
The previous prime is 103013032883. The next prime is 103013033059. The reversal of 103013033013 is 310330310301.
103013033013 is a `hidden beast` number, since 1 + 0 + 301 + 30 + 330 + 1 + 3 = 666.
It is not a de Polignac number, because 103013033013 - 29 = 103013032501 is a prime.
It is a super-2 number, since 2×1030130330132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103013033063) 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 31 ways as a sum of consecutive naturals, for example, 1225170 + ... + 1306547.
It is an arithmetic number, because the mean of its divisors is an integer number (5240656260).
Almost surely, 2103013033013 is an apocalyptic number.
It is an amenable number.
103013033013 is a deficient number, since it is larger than the sum of its proper divisors (64687967307).
103013033013 is a wasteful number, since it uses less digits than its factorization.
103013033013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2531874 (or 2531868 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 18.
Adding to 103013033013 its reverse (310330310301), we get a palindrome (413343343314).
The spelling of 103013033013 in words is "one hundred three billion, thirteen million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.074 sec. • engine limits •