Base | Representation |
---|---|
bin | 110111111001010011… |
… | …1000011100000010101 |
3 | 102110211101222101222211 |
4 | 1233302213003200111 |
5 | 3431312304104422 |
6 | 131050522353421 |
7 | 11446364626114 |
oct | 1576247034025 |
9 | 373741871884 |
10 | 120034441237 |
11 | 469a7349357 |
12 | 1b31b35b871 |
13 | b41c3859b9 |
14 | 5b49b4dc7b |
15 | 31c800a577 |
hex | 1bf29c3815 |
120034441237 has 2 divisors, whose sum is σ = 120034441238. Its totient is φ = 120034441236.
The previous prime is 120034441213. The next prime is 120034441277. The reversal of 120034441237 is 732144430021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111645529956 + 8388911281 = 334134^2 + 91591^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120034441237 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120034441199 and 120034441208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120034441277) 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 as a sum of consecutive naturals, namely, 60017220618 + 60017220619.
It is an arithmetic number, because the mean of its divisors is an integer number (60017220619).
Almost surely, 2120034441237 is an apocalyptic number.
It is an amenable number.
120034441237 is a deficient number, since it is larger than the sum of its proper divisors (1).
120034441237 is an equidigital number, since it uses as much as digits as its factorization.
120034441237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 31.
Adding to 120034441237 its reverse (732144430021), we get a palindrome (852178871258).
The spelling of 120034441237 in words is "one hundred twenty billion, thirty-four million, four hundred forty-one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •