Base | Representation |
---|---|
bin | 1010111101011011010111… |
… | …1011000000110011011001 |
3 | 1120200000021120012110020121 |
4 | 2233112311323000303121 |
5 | 3034413242431124121 |
6 | 41343521003553241 |
7 | 2352421010643400 |
oct | 257266573006331 |
9 | 46600246173217 |
10 | 12050435411161 |
11 | 39266196a9794 |
12 | 142755652b821 |
13 | 69547471bb44 |
14 | 2d935c090637 |
15 | 15d6d5b21141 |
hex | af5b5ec0cd9 |
12050435411161 has 24 divisors (see below), whose sum is σ = 14919337048680. Its totient is φ = 9670989791232.
The previous prime is 12050435411149. The next prime is 12050435411219. The reversal of 12050435411161 is 16111453405021.
It can be written as a sum of positive squares in 4 ways, for example, as 1655195463936 + 10395239947225 = 1286544^2 + 3224165^2 .
It is not a de Polignac number, because 12050435411161 - 27 = 12050435411033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12050435411101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 37316716 + ... + 37638253.
It is an arithmetic number, because the mean of its divisors is an integer number (621639043695).
Almost surely, 212050435411161 is an apocalyptic number.
It is an amenable number.
12050435411161 is a deficient number, since it is larger than the sum of its proper divisors (2868901637519).
12050435411161 is a wasteful number, since it uses less digits than its factorization.
12050435411161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74955193 (or 74955186 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 34.
Adding to 12050435411161 its reverse (16111453405021), we get a palindrome (28161888816182).
The spelling of 12050435411161 in words is "twelve trillion, fifty billion, four hundred thirty-five million, four hundred eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.085 sec. • engine limits •