Base | Representation |
---|---|
bin | 111001010001110100… |
… | …0011001110110110001 |
3 | 102202111101102000121002 |
4 | 1302203220121312301 |
5 | 4003403104042121 |
6 | 132301334211345 |
7 | 11613106553522 |
oct | 1624350316661 |
9 | 382441360532 |
10 | 123004362161 |
11 | 4819083495a |
12 | 1ba09ab3b55 |
13 | b7a3768265 |
14 | 5d4c366849 |
15 | 32edb0be0b |
hex | 1ca3a19db1 |
123004362161 has 8 divisors (see below), whose sum is σ = 124523167104. Its totient is φ = 121486434160.
The previous prime is 123004362149. The next prime is 123004362163. The reversal of 123004362161 is 161263400321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123004362161 - 226 = 122937253297 is a prime.
It is a super-2 number, since 2×1230043621612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123004362163) 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 7 ways as a sum of consecutive naturals, for example, 65291 + ... + 500271.
It is an arithmetic number, because the mean of its divisors is an integer number (15565395888).
Almost surely, 2123004362161 is an apocalyptic number.
It is an amenable number.
123004362161 is a deficient number, since it is larger than the sum of its proper divisors (1518804943).
123004362161 is an equidigital number, since it uses as much as digits as its factorization.
123004362161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438471.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 123004362161 its reverse (161263400321), we get a palindrome (284267762482).
The spelling of 123004362161 in words is "one hundred twenty-three billion, four million, three hundred sixty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •