Base | Representation |
---|---|
bin | 1001001100000101000100… |
… | …0100001100001011000001 |
3 | 1022202211221000121012022011 |
4 | 2103001101010030023001 |
5 | 2311012144010224441 |
6 | 33253151035412521 |
7 | 2061632544456214 |
oct | 223012104141301 |
9 | 38684830535264 |
10 | 10103123133121 |
11 | 324578a691277 |
12 | 11720775b4141 |
13 | 583949a02515 |
14 | 26cdcac8977b |
15 | 127c13445581 |
hex | 9305110c2c1 |
10103123133121 has 8 divisors (see below), whose sum is σ = 10126691491680. Its totient is φ = 10079580436992.
The previous prime is 10103123133097. The next prime is 10103123133137. The reversal of 10103123133121 is 12133132130101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10103123133121 - 225 = 10103089578689 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10103123133092 and 10103123133101.
It is not an unprimeable number, because it can be changed into a prime (10103123136121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5627191 + ... + 7202188.
It is an arithmetic number, because the mean of its divisors is an integer number (1265836436460).
Almost surely, 210103123133121 is an apocalyptic number.
It is an amenable number.
10103123133121 is a deficient number, since it is larger than the sum of its proper divisors (23568358559).
10103123133121 is a wasteful number, since it uses less digits than its factorization.
10103123133121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12831215.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10103123133121 its reverse (12133132130101), we get a palindrome (22236255263222).
The spelling of 10103123133121 in words is "ten trillion, one hundred three billion, one hundred twenty-three million, one hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •