Base | Representation |
---|---|
bin | 1001001101000111110100… |
… | …1111011000010111011101 |
3 | 1022211120011222010100000001 |
4 | 2103101331033120113131 |
5 | 2311310344244231331 |
6 | 33305313220534301 |
7 | 2063135623452241 |
oct | 223217517302735 |
9 | 38746158110001 |
10 | 10121044133341 |
11 | 3252346615a59 |
12 | 1175639251391 |
13 | 585544762a6b |
14 | 26dc0add0421 |
15 | 1284118e6561 |
hex | 9347d3d85dd |
10121044133341 has 4 divisors (see below), whose sum is σ = 10263594050784. Its totient is φ = 9978494215900.
The previous prime is 10121044133311. The next prime is 10121044133351. The reversal of 10121044133341 is 14333144012101.
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.
It is a cyclic number.
It is not a de Polignac number, because 10121044133341 - 241 = 7922020877789 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10121044133311) 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, 71274958615 + ... + 71274958756.
It is an arithmetic number, because the mean of its divisors is an integer number (2565898512696).
Almost surely, 210121044133341 is an apocalyptic number.
It is an amenable number.
10121044133341 is a deficient number, since it is larger than the sum of its proper divisors (142549917443).
10121044133341 is an equidigital number, since it uses as much as digits as its factorization.
10121044133341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142549917442.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 10121044133341 its reverse (14333144012101), we get a palindrome (24454188145442).
The spelling of 10121044133341 in words is "ten trillion, one hundred twenty-one billion, forty-four million, one hundred thirty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •