Base | Representation |
---|---|
bin | 1001001100000101000011… |
… | …1100100011011100101111 |
3 | 1022202211220212211111100001 |
4 | 2103001100330203130233 |
5 | 2311012143002200221 |
6 | 33253150524445131 |
7 | 2061632521451065 |
oct | 223012074433457 |
9 | 38684825744301 |
10 | 10103121131311 |
11 | 324578954428a |
12 | 11720769a97a7 |
13 | 583949481310 |
14 | 26cdca8c8035 |
15 | 127c1319c391 |
hex | 93050f2372f |
10103121131311 has 8 divisors (see below), whose sum is σ = 11029329286640. Its totient is φ = 9198205117632.
The previous prime is 10103121131293. The next prime is 10103121131353. The reversal of 10103121131311 is 11313112130101.
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 10103121131311 - 29 = 10103121130799 is a prime.
It is a super-3 number, since 3×101031211313113 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10103121134311) 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, 5323034421 + ... + 5323036318.
It is an arithmetic number, because the mean of its divisors is an integer number (1378666160830).
Almost surely, 210103121131311 is an apocalyptic number.
10103121131311 is a deficient number, since it is larger than the sum of its proper divisors (926208155329).
10103121131311 is a wasteful number, since it uses less digits than its factorization.
10103121131311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10646070825.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 10103121131311 its reverse (11313112130101), we get a palindrome (21416233261412).
The spelling of 10103121131311 in words is "ten trillion, one hundred three billion, one hundred twenty-one million, one hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •