Base | Representation |
---|---|
bin | 11100000101100110101011… |
… | …100001010101111110010101 |
3 | 121012101101122012112002020222 |
4 | 130011212223201111332111 |
5 | 112142410311100414244 |
6 | 1114421032544004125 |
7 | 35006531156345006 |
oct | 3405465341257625 |
9 | 535341565462228 |
10 | 123530432044949 |
11 | 363a6a64504156 |
12 | 11a31037900645 |
13 | 53c0b3cb20a17 |
14 | 2270c94b3b1ad |
15 | e4349b4e9bee |
hex | 7059ab855f95 |
123530432044949 has 2 divisors, whose sum is σ = 123530432044950. Its totient is φ = 123530432044948.
The previous prime is 123530432044927. The next prime is 123530432045023. The reversal of 123530432044949 is 949440234035321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75198987910225 + 48331444134724 = 8671735^2 + 6952082^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123530432044949 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123530432044949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123530432040949) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61765216022474 + 61765216022475.
It is an arithmetic number, because the mean of its divisors is an integer number (61765216022475).
Almost surely, 2123530432044949 is an apocalyptic number.
It is an amenable number.
123530432044949 is a deficient number, since it is larger than the sum of its proper divisors (1).
123530432044949 is an equidigital number, since it uses as much as digits as its factorization.
123530432044949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11197440, while the sum is 53.
The spelling of 123530432044949 in words is "one hundred twenty-three trillion, five hundred thirty billion, four hundred thirty-two million, forty-four thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •