Base | Representation |
---|---|
bin | 10110100010110011… |
… | …01111100101000111 |
3 | 1011020111011021002000 |
4 | 23101121233211013 |
5 | 144241344334343 |
6 | 5320551520343 |
7 | 605632555464 |
oct | 132131574507 |
9 | 34214137060 |
10 | 12103121223 |
11 | 5150995126 |
12 | 24193890b3 |
13 | 11ab62bbbb |
14 | 82b5c266b |
15 | 4ac83eed3 |
hex | 2d166f947 |
12103121223 has 8 divisors (see below), whose sum is σ = 17930550000. Its totient is φ = 8068747464.
The previous prime is 12103121221. The next prime is 12103121237. The reversal of 12103121223 is 32212130121.
It is not a de Polignac number, because 12103121223 - 21 = 12103121221 is a prime.
It is a super-3 number, since 3×121031212233 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12103121196 and 12103121205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12103121221) 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, 224131848 + ... + 224131901.
It is an arithmetic number, because the mean of its divisors is an integer number (2241318750).
Almost surely, 212103121223 is an apocalyptic number.
12103121223 is a deficient number, since it is larger than the sum of its proper divisors (5827428777).
12103121223 is an equidigital number, since it uses as much as digits as its factorization.
12103121223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448263758 (or 448263752 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 12103121223 its reverse (32212130121), we get a palindrome (44315251344).
The spelling of 12103121223 in words is "twelve billion, one hundred three million, one hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •