Base | Representation |
---|---|
bin | 10010110100011010… |
… | …01110011101010011 |
3 | 222002010020102012202 |
4 | 21122031032131103 |
5 | 131142424213443 |
6 | 4350313513415 |
7 | 505241032115 |
oct | 113215163523 |
9 | 28063212182 |
10 | 10103351123 |
11 | 4315095268 |
12 | 1b5b71286b |
13 | c50235398 |
14 | 6bbb873b5 |
15 | 3e1ec57b8 |
hex | 25a34e753 |
10103351123 has 4 divisors (see below), whose sum is σ = 10207509480. Its totient is φ = 9999192768.
The previous prime is 10103351117. The next prime is 10103351149. The reversal of 10103351123 is 32115330101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32115330101 = 45599 ⋅704299.
It is a cyclic number.
It is not a de Polignac number, because 10103351123 - 28 = 10103350867 is a prime.
It is a super-2 number, since 2×101033511232 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10103351095 and 10103351104.
It is not an unprimeable number, because it can be changed into a prime (10103351113) 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, 52079033 + ... + 52079226.
It is an arithmetic number, because the mean of its divisors is an integer number (2551877370).
Almost surely, 210103351123 is an apocalyptic number.
10103351123 is a deficient number, since it is larger than the sum of its proper divisors (104158357).
10103351123 is an equidigital number, since it uses as much as digits as its factorization.
10103351123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104158356.
The product of its (nonzero) digits is 270, while the sum is 20.
Adding to 10103351123 its reverse (32115330101), we get a palindrome (42218681224).
The spelling of 10103351123 in words is "ten billion, one hundred three million, three hundred fifty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •