Base | Representation |
---|---|
bin | 111111101101101011… |
… | …0010101110100000101 |
3 | 111002011111121001111102 |
4 | 1333123112111310011 |
5 | 4220203424143442 |
6 | 142504530145445 |
7 | 12612425155412 |
oct | 1773326256405 |
9 | 432144531442 |
10 | 136824052997 |
11 | 5303267a155 |
12 | 22626122285 |
13 | cb968c5608 |
14 | 689d905109 |
15 | 385bec5232 |
hex | 1fdb595d05 |
136824052997 has 4 divisors (see below), whose sum is σ = 141542123820. Its totient is φ = 132105982176.
The previous prime is 136824052991. The next prime is 136824053017. The reversal of 136824052997 is 799250428631.
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 63060752161 + 73763300836 = 251119^2 + 271594^2 .
It is a cyclic number.
It is not a de Polignac number, because 136824052997 - 212 = 136824048901 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 (136824052991) 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, 2359035368 + ... + 2359035425.
It is an arithmetic number, because the mean of its divisors is an integer number (35385530955).
It is a 2-persistent number, because it is pandigital, and so is 2⋅136824052997 = 273648105994, but 3⋅136824052997 = 410472158991 is not.
Almost surely, 2136824052997 is an apocalyptic number.
It is an amenable number.
136824052997 is a deficient number, since it is larger than the sum of its proper divisors (4718070823).
136824052997 is an equidigital number, since it uses as much as digits as its factorization.
136824052997 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4718070822.
The product of its (nonzero) digits is 6531840, while the sum is 56.
The spelling of 136824052997 in words is "one hundred thirty-six billion, eight hundred twenty-four million, fifty-two thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •