Base | Representation |
---|---|
bin | 10110100010110101… |
… | …00101110001101111 |
3 | 1011020111120112120221 |
4 | 23101122211301233 |
5 | 144241423440330 |
6 | 5321000352211 |
7 | 605634501625 |
oct | 132132456157 |
9 | 34214515527 |
10 | 12103343215 |
11 | 5151026997 |
12 | 2419475667 |
13 | 11ab6a8c62 |
14 | 82b63d515 |
15 | 4ac885b7a |
hex | 2d16a5c6f |
12103343215 has 4 divisors (see below), whose sum is σ = 14524011864. Its totient is φ = 9682674568.
The previous prime is 12103343191. The next prime is 12103343221. The reversal of 12103343215 is 51234330121.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 51234330121 = 13 ⋅3941102317.
It is a cyclic number.
It is not a de Polignac number, because 12103343215 - 229 = 11566472303 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12103343215.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1210334317 + ... + 1210334326.
It is an arithmetic number, because the mean of its divisors is an integer number (3631002966).
Almost surely, 212103343215 is an apocalyptic number.
12103343215 is a deficient number, since it is larger than the sum of its proper divisors (2420668649).
12103343215 is an equidigital number, since it uses as much as digits as its factorization.
12103343215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2420668648.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 12103343215 its reverse (51234330121), we get a palindrome (63337673336).
The spelling of 12103343215 in words is "twelve billion, one hundred three million, three hundred forty-three thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •