Base | Representation |
---|---|
bin | 101111111110000001… |
… | …1011101011110100011 |
3 | 100211220011011021122000 |
4 | 1133330003131132203 |
5 | 3141432312412121 |
6 | 115153514215043 |
7 | 10304521111110 |
oct | 1377403353643 |
9 | 324804137560 |
10 | 103013013411 |
11 | 3a762184730 |
12 | 17b6aa24483 |
13 | 9938acc309 |
14 | 4db3293907 |
15 | 2a2d9ee526 |
hex | 17fc0dd7a3 |
103013013411 has 64 divisors (see below), whose sum is σ = 191722291200. Its totient is φ = 53104615200.
The previous prime is 103013013407. The next prime is 103013013419. The reversal of 103013013411 is 114310310301.
It is not a de Polignac number, because 103013013411 - 22 = 103013013407 is a prime.
It is a super-2 number, since 2×1030130134112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103013013419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 83230 + ... + 461468.
It is an arithmetic number, because the mean of its divisors is an integer number (2995660800).
Almost surely, 2103013013411 is an apocalyptic number.
103013013411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
103013013411 is a deficient number, since it is larger than the sum of its proper divisors (88709277789).
103013013411 is a wasteful number, since it uses less digits than its factorization.
103013013411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378397 (or 378391 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 103013013411 its reverse (114310310301), we get a palindrome (217323323712).
The spelling of 103013013411 in words is "one hundred three billion, thirteen million, thirteen thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •