Base | Representation |
---|---|
bin | 11100000000000110001111… |
… | …001111011001001110000001 |
3 | 121011001012211122201111101112 |
4 | 130000012033033121032001 |
5 | 112120210244104034203 |
6 | 1113531125321413105 |
7 | 34640303243042366 |
oct | 3400061717311601 |
9 | 534035748644345 |
10 | 123152000455553 |
11 | 36270519766993 |
12 | 1198b82393a195 |
13 | 5394250ab2824 |
14 | 225a83529046d |
15 | e386ed3cb6d8 |
hex | 70018f3d9381 |
123152000455553 has 2 divisors, whose sum is σ = 123152000455554. Its totient is φ = 123152000455552.
The previous prime is 123152000455541. The next prime is 123152000455573. The reversal of 123152000455553 is 355554000251321.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95803828171249 + 27348172284304 = 9787943^2 + 5229548^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123152000455553 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 123152000455553.
It is not a weakly prime, because it can be changed into another prime (123152000455573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61576000227776 + 61576000227777.
It is an arithmetic number, because the mean of its divisors is an integer number (61576000227777).
Almost surely, 2123152000455553 is an apocalyptic number.
It is an amenable number.
123152000455553 is a deficient number, since it is larger than the sum of its proper divisors (1).
123152000455553 is an equidigital number, since it uses as much as digits as its factorization.
123152000455553 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 450000, while the sum is 41.
The spelling of 123152000455553 in words is "one hundred twenty-three trillion, one hundred fifty-two billion, four hundred fifty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •