Base | Representation |
---|---|
bin | 11011111110000110000000… |
… | …010000001100001011001001 |
3 | 121010120001102202221022002222 |
4 | 123332012000100030023021 |
5 | 112110431301333140203 |
6 | 1113343554402303425 |
7 | 34624330164655133 |
oct | 3376060020141311 |
9 | 533501382838088 |
10 | 123014310052553 |
11 | 362180920591a7 |
12 | 11968bb7657b75 |
13 | 5384279875c9a |
14 | 2253cd26ac053 |
15 | e34d40325038 |
hex | 6fe18040c2c9 |
123014310052553 has 16 divisors (see below), whose sum is σ = 132249244657920. Its totient is φ = 114055628328576.
The previous prime is 123014310052421. The next prime is 123014310052559. The reversal of 123014310052553 is 355250013410321.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 123014310052553 - 214 = 123014310036169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123014310052559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19084325 + ... + 24703037.
It is an arithmetic number, because the mean of its divisors is an integer number (8265577791120).
Almost surely, 2123014310052553 is an apocalyptic number.
It is an amenable number.
123014310052553 is a deficient number, since it is larger than the sum of its proper divisors (9234934605367).
123014310052553 is a wasteful number, since it uses less digits than its factorization.
123014310052553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5643296.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 123014310052553 its reverse (355250013410321), we get a palindrome (478264323462874).
The spelling of 123014310052553 in words is "one hundred twenty-three trillion, fourteen billion, three hundred ten million, fifty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •