Base | Representation |
---|---|
bin | 111111110001100010… |
… | …1101100010110001101 |
3 | 111002111112221022010010 |
4 | 1333203011230112031 |
5 | 4220440200002243 |
6 | 142525445303433 |
7 | 12615562666311 |
oct | 1774305542615 |
9 | 432445838103 |
10 | 136953906573 |
11 | 53099a01060 |
12 | 22661704b79 |
13 | cbb778c553 |
14 | 68b2c67b41 |
15 | 38685c5433 |
hex | 1fe316c58d |
136953906573 has 32 divisors (see below), whose sum is σ = 201243715200. Its totient is φ = 82153728000.
The previous prime is 136953906547. The next prime is 136953906613. The reversal of 136953906573 is 375609359631.
It is not a de Polignac number, because 136953906573 - 28 = 136953906317 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136953106573) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15757413 + ... + 15766101.
It is an arithmetic number, because the mean of its divisors is an integer number (6288866100).
Almost surely, 2136953906573 is an apocalyptic number.
It is an amenable number.
136953906573 is a deficient number, since it is larger than the sum of its proper divisors (64289808627).
136953906573 is a wasteful number, since it uses less digits than its factorization.
136953906573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13533.
The product of its (nonzero) digits is 13778100, while the sum is 57.
The spelling of 136953906573 in words is "one hundred thirty-six billion, nine hundred fifty-three million, nine hundred six thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •