Base | Representation |
---|---|
bin | 100010111011110011110011… |
… | …010100000110000100110001 |
3 | 202011000012010021222212102211 |
4 | 202323303303110012010301 |
5 | 130114244144433300021 |
6 | 1302434530333012121 |
7 | 44235246634622341 |
oct | 4273636324060461 |
9 | 664005107885384 |
10 | 153643652243761 |
11 | 44a569a8234349 |
12 | 15295204324041 |
13 | 67966c394b444 |
14 | 29d256cc32d21 |
15 | 12b6955e593e1 |
hex | 8bbcf3506131 |
153643652243761 has 16 divisors (see below), whose sum is σ = 160357452295680. Its totient is φ = 146932659118080.
The previous prime is 153643652243717. The next prime is 153643652243803. The reversal of 153643652243761 is 167342256346351.
It is a cyclic number.
It is not a de Polignac number, because 153643652243761 - 213 = 153643652235569 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 153643652243696 and 153643652243705.
It is not an unprimeable number, because it can be changed into a prime (153643650243761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2714955576 + ... + 2715012166.
It is an arithmetic number, because the mean of its divisors is an integer number (10022340768480).
Almost surely, 2153643652243761 is an apocalyptic number.
It is an amenable number.
153643652243761 is a deficient number, since it is larger than the sum of its proper divisors (6713800051919).
153643652243761 is a wasteful number, since it uses less digits than its factorization.
153643652243761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79296.
The product of its digits is 65318400, while the sum is 58.
The spelling of 153643652243761 in words is "one hundred fifty-three trillion, six hundred forty-three billion, six hundred fifty-two million, two hundred forty-three thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •