Base | Representation |
---|---|
bin | 11011111110100111010110… |
… | …010001101000101101001011 |
3 | 121010200110211221112000021202 |
4 | 123332213112101220231023 |
5 | 112112023112412314012 |
6 | 1113412235212054415 |
7 | 34630035340044554 |
oct | 3376472621505513 |
9 | 533613757460252 |
10 | 123050113010507 |
11 | 36231294980451 |
12 | 11973b29a6440b |
13 | 5387764246cc7 |
14 | 225592b6b332b |
15 | e35c38613cc2 |
hex | 6fe9d6468b4b |
123050113010507 has 2 divisors, whose sum is σ = 123050113010508. Its totient is φ = 123050113010506.
The previous prime is 123050113010483. The next prime is 123050113010521. The reversal of 123050113010507 is 705010311050321.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123050113010507 - 228 = 123049844575051 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 123050113010507.
It is not a weakly prime, because it can be changed into another prime (123050115010507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61525056505253 + 61525056505254.
It is an arithmetic number, because the mean of its divisors is an integer number (61525056505254).
Almost surely, 2123050113010507 is an apocalyptic number.
123050113010507 is a deficient number, since it is larger than the sum of its proper divisors (1).
123050113010507 is an equidigital number, since it uses as much as digits as its factorization.
123050113010507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 29.
Adding to 123050113010507 its reverse (705010311050321), we get a palindrome (828060424060828).
The spelling of 123050113010507 in words is "one hundred twenty-three trillion, fifty billion, one hundred thirteen million, ten thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •