Base | Representation |
---|---|
bin | 1100000000000011010… |
… | …00000101000011100111 |
3 | 1110102022222020212022011 |
4 | 12000001220011003213 |
5 | 23223440100102403 |
6 | 513232302015051 |
7 | 41535162252223 |
oct | 6000150050347 |
9 | 1412288225264 |
10 | 412344144103 |
11 | 149968579591 |
12 | 67ab9277487 |
13 | 2cb64b88818 |
14 | 15d597a5783 |
15 | aad5497a6d |
hex | 6001a050e7 |
412344144103 has 4 divisors (see below), whose sum is σ = 412347479328. Its totient is φ = 412340808880.
The previous prime is 412344144073. The next prime is 412344144203. The reversal of 412344144103 is 301441443214.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301441443214 = 2 ⋅150720721607.
It is a cyclic number.
It is not a de Polignac number, because 412344144103 - 237 = 274905190631 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (412344144203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1474726 + ... + 1731907.
It is an arithmetic number, because the mean of its divisors is an integer number (103086869832).
Almost surely, 2412344144103 is an apocalyptic number.
412344144103 is a deficient number, since it is larger than the sum of its proper divisors (3335225).
412344144103 is a wasteful number, since it uses less digits than its factorization.
412344144103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3335224.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 412344144103 its reverse (301441443214), we get a palindrome (713785587317).
The spelling of 412344144103 in words is "four hundred twelve billion, three hundred forty-four million, one hundred forty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •