Base | Representation |
---|---|
bin | 11110111101010011101011… |
… | …001111100010101000111011 |
3 | 122212002020022221012201101011 |
4 | 132331103223033202220323 |
5 | 120321223212430044003 |
6 | 1201324250015134351 |
7 | 40451555130453550 |
oct | 3675235317425073 |
9 | 585066287181334 |
10 | 136154410003003 |
11 | 3a4238409aa307 |
12 | 1332b7785143b7 |
13 | 5ac83c8a1a462 |
14 | 2589ca12dca27 |
15 | 10b1a4e37346d |
hex | 7bd4eb3e2a3b |
136154410003003 has 8 divisors (see below), whose sum is σ = 155628048343808. Its totient is φ = 116686523747304.
The previous prime is 136154410002901. The next prime is 136154410003061. The reversal of 136154410003003 is 300300014451631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-136154410003003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136154410003093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1437970551 + ... + 1438065232.
It is an arithmetic number, because the mean of its divisors is an integer number (19453506042976).
Almost surely, 2136154410003003 is an apocalyptic number.
136154410003003 is a deficient number, since it is larger than the sum of its proper divisors (19473638340805).
136154410003003 is an equidigital number, since it uses as much as digits as its factorization.
136154410003003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2876042553.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 136154410003003 its reverse (300300014451631), we get a palindrome (436454424454634).
The spelling of 136154410003003 in words is "one hundred thirty-six trillion, one hundred fifty-four billion, four hundred ten million, three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •