Base | Representation |
---|---|
bin | 11100000101100111010011… |
… | …011010011011010100110101 |
3 | 121012101110100211212210201101 |
4 | 130011213103122123110311 |
5 | 112142413143414224001 |
6 | 1114421223212530101 |
7 | 35006553564162460 |
oct | 3405472332332465 |
9 | 535343324783641 |
10 | 123531101320501 |
11 | 363a7278278846 |
12 | 11a311a3a80931 |
13 | 53c0c18693464 |
14 | 2270d199982d7 |
15 | e434da14da01 |
hex | 7059d369b535 |
123531101320501 has 16 divisors (see below), whose sum is σ = 143843073261696. Its totient is φ = 103897595805696.
The previous prime is 123531101320483. The next prime is 123531101320511. The reversal of 123531101320501 is 105023101135321.
It is not a de Polignac number, because 123531101320501 - 211 = 123531101318453 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 123531101320501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123531101320511) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 512316316 + ... + 512557381.
It is an arithmetic number, because the mean of its divisors is an integer number (8990192078856).
Almost surely, 2123531101320501 is an apocalyptic number.
It is an amenable number.
123531101320501 is a deficient number, since it is larger than the sum of its proper divisors (20311971941195).
123531101320501 is a wasteful number, since it uses less digits than its factorization.
123531101320501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1024874028.
The product of its (nonzero) digits is 2700, while the sum is 28.
Adding to 123531101320501 its reverse (105023101135321), we get a palindrome (228554202455822).
The spelling of 123531101320501 in words is "one hundred twenty-three trillion, five hundred thirty-one billion, one hundred one million, three hundred twenty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •