Base | Representation |
---|---|
bin | 10001111000000010110… |
… | …111000010010001110111 |
3 | 11100102201220112221211120 |
4 | 101320002313002101313 |
5 | 130111240102101333 |
6 | 2340153444035023 |
7 | 154515053026251 |
oct | 21700267022167 |
9 | 4312656487746 |
10 | 1228408628343 |
11 | 433a68712036 |
12 | 17a0a7692a73 |
13 | 8bab9078470 |
14 | 43653486cd1 |
15 | 21e48c6bdb3 |
hex | 11e02dc2477 |
1228408628343 has 24 divisors (see below), whose sum is σ = 1873729157328. Its totient is φ = 711476484096.
The previous prime is 1228408628341. The next prime is 1228408628347. The reversal of 1228408628343 is 3438268048221.
It is a happy number.
It is not a de Polignac number, because 1228408628343 - 21 = 1228408628341 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1228408628341) 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 23 ways as a sum of consecutive naturals, for example, 54482946 + ... + 54505487.
It is an arithmetic number, because the mean of its divisors is an integer number (78072048222).
Almost surely, 21228408628343 is an apocalyptic number.
1228408628343 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1228408628343 is a deficient number, since it is larger than the sum of its proper divisors (645320528985).
1228408628343 is a wasteful number, since it uses less digits than its factorization.
1228408628343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108988483 (or 108988466 counting only the distinct ones).
The product of its (nonzero) digits is 3538944, while the sum is 51.
The spelling of 1228408628343 in words is "one trillion, two hundred twenty-eight billion, four hundred eight million, six hundred twenty-eight thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •