Base | Representation |
---|---|
bin | 1001001000111111101111… |
… | …1000111100011011011101 |
3 | 1022120210012112210120000012 |
4 | 2102033323320330123131 |
5 | 2304130204023423031 |
6 | 33212551030213005 |
7 | 2055046124600510 |
oct | 222177370743335 |
9 | 38523175716005 |
10 | 10050154514141 |
11 | 3225279241905 |
12 | 11639544b4165 |
13 | 57b957c17a21 |
14 | 26a6041a0d77 |
15 | 126663159b2b |
hex | 923fbe3c6dd |
10050154514141 has 8 divisors (see below), whose sum is σ = 11500053507264. Its totient is φ = 8603796179520.
The previous prime is 10050154514111. The next prime is 10050154514149. The reversal of 10050154514141 is 14141545105001.
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 10050154514141 - 218 = 10050154251997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10050154514098 and 10050154514107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10050154514149) 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, 885158540 + ... + 885169893.
It is an arithmetic number, because the mean of its divisors is an integer number (1437506688408).
Almost surely, 210050154514141 is an apocalyptic number.
It is an amenable number.
10050154514141 is a deficient number, since it is larger than the sum of its proper divisors (1449898993123).
10050154514141 is an equidigital number, since it uses as much as digits as its factorization.
10050154514141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1770329251.
The product of its (nonzero) digits is 8000, while the sum is 32.
Adding to 10050154514141 its reverse (14141545105001), we get a palindrome (24191699619142).
The spelling of 10050154514141 in words is "ten trillion, fifty billion, one hundred fifty-four million, five hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •