Base | Representation |
---|---|
bin | 10010110100100000… |
… | …01010011111100001 |
3 | 222002011200112201022 |
4 | 21122100022133201 |
5 | 131143123340223 |
6 | 4350342215225 |
7 | 505250420426 |
oct | 113220123741 |
9 | 28064615638 |
10 | 10104121313 |
11 | 4315570990 |
12 | 1b5ba24515 |
13 | c50444b10 |
14 | 6bbd07d4d |
15 | 3e20c8ac8 |
hex | 25a40a7e1 |
10104121313 has 32 divisors (see below), whose sum is σ = 12103392000. Its totient is φ = 8313580800.
The previous prime is 10104121289. The next prime is 10104121337. The reversal of 10104121313 is 31312140101.
It is an interprime number because it is at equal distance from previous prime (10104121289) and next prime (10104121337).
It is a cyclic number.
It is not a de Polignac number, because 10104121313 - 216 = 10104055777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10104121291 and 10104121300.
It is not an unprimeable number, because it can be changed into a prime (10104121373) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3042668 + ... + 3045986.
It is an arithmetic number, because the mean of its divisors is an integer number (378231000).
Almost surely, 210104121313 is an apocalyptic number.
10104121313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
10104121313 is a deficient number, since it is larger than the sum of its proper divisors (1999270687).
10104121313 is a wasteful number, since it uses less digits than its factorization.
10104121313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3753.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10104121313 its reverse (31312140101), we get a palindrome (41416261414).
The spelling of 10104121313 in words is "ten billion, one hundred four million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •