Base | Representation |
---|---|
bin | 10010110100011000… |
… | …10111001000100001 |
3 | 222002002210220100210 |
4 | 21122030113020201 |
5 | 131142344441023 |
6 | 4350305004333 |
7 | 505236066336 |
oct | 113214271041 |
9 | 28062726323 |
10 | 10103124513 |
11 | 4314a4aa89 |
12 | 1b5b6236a9 |
13 | c501861b1 |
14 | 6bbb2898d |
15 | 3e1e7d593 |
hex | 25a317221 |
10103124513 has 4 divisors (see below), whose sum is σ = 13470832688. Its totient is φ = 6735416340.
The previous prime is 10103124491. The next prime is 10103124529. The reversal of 10103124513 is 31542130101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31542130101 = 3 ⋅10514043367.
It is not a de Polignac number, because 10103124513 - 28 = 10103124257 is a prime.
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 10103124513.
It is not an unprimeable number, because it can be changed into a prime (10103124553) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1683854083 + ... + 1683854088.
It is an arithmetic number, because the mean of its divisors is an integer number (3367708172).
Almost surely, 210103124513 is an apocalyptic number.
It is an amenable number.
10103124513 is a deficient number, since it is larger than the sum of its proper divisors (3367708175).
10103124513 is an equidigital number, since it uses as much as digits as its factorization.
10103124513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3367708174.
The product of its (nonzero) digits is 360, while the sum is 21.
Adding to 10103124513 its reverse (31542130101), we get a palindrome (41645254614).
The spelling of 10103124513 in words is "ten billion, one hundred three million, one hundred twenty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •