Base | Representation |
---|---|
bin | 10000010110010011001… |
… | …011010000101001100101 |
3 | 10222101211120001002122100 |
4 | 100112103023100221211 |
5 | 121401314122314124 |
6 | 2220035225522313 |
7 | 144111164414511 |
oct | 20262313205145 |
9 | 3871746032570 |
10 | 1123455666789 |
11 | 3a3500487685 |
12 | 161897043399 |
13 | 81c31399551 |
14 | 3c5386cb141 |
15 | 1e354cbd1c9 |
hex | 105932d0a65 |
1123455666789 has 12 divisors (see below), whose sum is σ = 1650273861600. Its totient is φ = 736276029864.
The previous prime is 1123455666721. The next prime is 1123455666829. The reversal of 1123455666789 is 9876665543211.
It is a happy number.
It is not a de Polignac number, because 1123455666789 - 219 = 1123455142501 is a prime.
It is a plaindrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123455466789) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1057867329 + ... + 1057868390.
It is an arithmetic number, because the mean of its divisors is an integer number (137522821800).
Almost surely, 21123455666789 is an apocalyptic number.
It is an amenable number.
1123455666789 is a deficient number, since it is larger than the sum of its proper divisors (526818194811).
1123455666789 is a wasteful number, since it uses less digits than its factorization.
1123455666789 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2115735784 (or 2115735781 counting only the distinct ones).
The product of its digits is 65318400, while the sum is 63.
It can be divided in two parts, 1123455 and 666789, that added together give a square (1790244 = 13382).
The spelling of 1123455666789 in words is "one trillion, one hundred twenty-three billion, four hundred fifty-five million, six hundred sixty-six thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •