Base | Representation |
---|---|
bin | 11110111101000110010110… |
… | …011111101010001111110111 |
3 | 122212000212101212120000221001 |
4 | 132331012112133222033313 |
5 | 120321004412413410343 |
6 | 1201313522224104131 |
7 | 40450540446255133 |
oct | 3675062637521767 |
9 | 585025355500831 |
10 | 136140103263223 |
11 | 3a41876a143a24 |
12 | 13328a45165047 |
13 | 5ac6c589c0b67 |
14 | 25893051ba3c3 |
15 | 10b14b334e44d |
hex | 7bd1967ea3f7 |
136140103263223 has 4 divisors (see below), whose sum is σ = 136141396701408. Its totient is φ = 136138809825040.
The previous prime is 136140103263217. The next prime is 136140103263251. The reversal of 136140103263223 is 322362301041631.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 136140103263223 - 225 = 136140069708791 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 (136140103363223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 646561198 + ... + 646771723.
It is an arithmetic number, because the mean of its divisors is an integer number (34035349175352).
Almost surely, 2136140103263223 is an apocalyptic number.
136140103263223 is a deficient number, since it is larger than the sum of its proper divisors (1293438185).
136140103263223 is a wasteful number, since it uses less digits than its factorization.
136140103263223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1293438184.
The product of its (nonzero) digits is 93312, while the sum is 37.
The spelling of 136140103263223 in words is "one hundred thirty-six trillion, one hundred forty billion, one hundred three million, two hundred sixty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •