Base | Representation |
---|---|
bin | 10110100010110101… |
… | …11010111111101001 |
3 | 1011020111201221210200 |
4 | 23101122322333221 |
5 | 144241434230441 |
6 | 5321002302413 |
7 | 605635313166 |
oct | 132132727751 |
9 | 34214657720 |
10 | 12103430121 |
11 | 5151086212 |
12 | 24194b7a09 |
13 | 11ab709693 |
14 | 82b66306d |
15 | 4ac8a17b6 |
hex | 2d16bafe9 |
12103430121 has 12 divisors (see below), whose sum is σ = 17955239172. Its totient is φ = 7850873376.
The previous prime is 12103430063. The next prime is 12103430153.
12103430121 is a `hidden beast` number, since 1 + 210 + 3 + 430 + 1 + 21 = 666.
12103430121 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 10596437721 + 1506992400 = 102939^2 + 38820^2 .
It is not a de Polignac number, because 12103430121 - 210 = 12103429097 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12103430094 and 12103430103.
It is not an unprimeable number, because it can be changed into a prime (12103430021) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18172986 + ... + 18173651.
It is an arithmetic number, because the mean of its divisors is an integer number (1496269931).
Almost surely, 212103430121 is an apocalyptic number.
It is an amenable number.
12103430121 is a deficient number, since it is larger than the sum of its proper divisors (5851809051).
12103430121 is a wasteful number, since it uses less digits than its factorization.
12103430121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36346680 (or 36346677 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The spelling of 12103430121 in words is "twelve billion, one hundred three million, four hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •