Base | Representation |
---|---|
bin | 11110111011101100010101… |
… | …101101011100110000111001 |
3 | 122211200121221011200001110022 |
4 | 132323230111231130300321 |
5 | 120312413443023233013 |
6 | 1201201255532500225 |
7 | 40440546411403403 |
oct | 3673542555346071 |
9 | 584617834601408 |
10 | 136043453336633 |
11 | 3a390782843637 |
12 | 1331217131a675 |
13 | 5abaac527639b |
14 | 258477704bb73 |
15 | 10adc082a9008 |
hex | 7bbb15b5cc39 |
136043453336633 has 4 divisors (see below), whose sum is σ = 136052727565860. Its totient is φ = 136034179107408.
The previous prime is 136043453336597. The next prime is 136043453336653. The reversal of 136043453336633 is 336633354340631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 82721153243689 + 53322300092944 = 9095117^2 + 7302212^2 .
It is a cyclic number.
It is not a de Polignac number, because 136043453336633 - 28 = 136043453336377 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136043453336653) 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, 4637092610 + ... + 4637121947.
It is an arithmetic number, because the mean of its divisors is an integer number (34013181891465).
Almost surely, 2136043453336633 is an apocalyptic number.
It is an amenable number.
136043453336633 is a deficient number, since it is larger than the sum of its proper divisors (9274229227).
136043453336633 is an equidigital number, since it uses as much as digits as its factorization.
136043453336633 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9274229226.
The product of its (nonzero) digits is 37791360, while the sum is 53.
The spelling of 136043453336633 in words is "one hundred thirty-six trillion, forty-three billion, four hundred fifty-three million, three hundred thirty-six thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •