Base | Representation |
---|---|
bin | 10001111000010110111… |
… | …000101101100100000111 |
3 | 11100110121022202200220112 |
4 | 101320112320231210013 |
5 | 130112432110041403 |
6 | 2340251045223235 |
7 | 154526302605611 |
oct | 21702670554407 |
9 | 4313538680815 |
10 | 1228744612103 |
11 | 434120333668 |
12 | 17a180101b1b |
13 | 8bb40864a18 |
14 | 43685d45db1 |
15 | 21e684d79d8 |
hex | 11e16e2d907 |
1228744612103 has 4 divisors (see below), whose sum is σ = 1258713992928. Its totient is φ = 1198775231280.
The previous prime is 1228744612091. The next prime is 1228744612169. The reversal of 1228744612103 is 3012164478221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1228744612103 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41), and also a Moran number because the ratio is a prime number: 29969380783 = 1228744612103 / (1 + 2 + 2 + 8 + 7 + 4 + 4 + 6 + 1 + 2 + 1 + 0 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1228744612003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14984690351 + ... + 14984690432.
It is an arithmetic number, because the mean of its divisors is an integer number (314678498232).
Almost surely, 21228744612103 is an apocalyptic number.
1228744612103 is a deficient number, since it is larger than the sum of its proper divisors (29969380825).
1228744612103 is an equidigital number, since it uses as much as digits as its factorization.
1228744612103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29969380824.
The product of its (nonzero) digits is 129024, while the sum is 41.
The spelling of 1228744612103 in words is "one trillion, two hundred twenty-eight billion, seven hundred forty-four million, six hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •