Base | Representation |
---|---|
bin | 110111111111001110… |
… | …0100000110110101101 |
3 | 102111100020121110112022 |
4 | 1233332130200312231 |
5 | 3432214122120321 |
6 | 131122334315525 |
7 | 11454325450463 |
oct | 1577634406655 |
9 | 374306543468 |
10 | 120233004461 |
11 | 46a9943a899 |
12 | 1b375958ba5 |
13 | b45155902b |
14 | 5b6827a833 |
15 | 31da67ddab |
hex | 1bfe720dad |
120233004461 has 2 divisors, whose sum is σ = 120233004462. Its totient is φ = 120233004460.
The previous prime is 120233004391. The next prime is 120233004481. The reversal of 120233004461 is 164400332021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80213001961 + 40020002500 = 283219^2 + 200050^2 .
It is a cyclic number.
It is not a de Polignac number, because 120233004461 - 218 = 120232742317 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 120233004461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (120233004481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60116502230 + 60116502231.
It is an arithmetic number, because the mean of its divisors is an integer number (60116502231).
Almost surely, 2120233004461 is an apocalyptic number.
It is an amenable number.
120233004461 is a deficient number, since it is larger than the sum of its proper divisors (1).
120233004461 is an equidigital number, since it uses as much as digits as its factorization.
120233004461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 120233004461 its reverse (164400332021), we get a palindrome (284633336482).
The spelling of 120233004461 in words is "one hundred twenty billion, two hundred thirty-three million, four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •