Base | Representation |
---|---|
bin | 11110111000101011011… |
… | …110011111001010000111 |
3 | 21111220101201102202020100 |
4 | 132320223132133022013 |
5 | 234233230433201310 |
6 | 4303011552535143 |
7 | 306225060004104 |
oct | 36705336371207 |
9 | 7456351382210 |
10 | 2122443256455 |
11 | 749139982715 |
12 | 2a3415b514b3 |
13 | 1251b79a1202 |
14 | 74a264b5aab |
15 | 3a322700ec0 |
hex | 1ee2b79f287 |
2122443256455 has 24 divisors (see below), whose sum is σ = 3838853891808. Its totient is φ = 1082753660736.
The previous prime is 2122443256441. The next prime is 2122443256517. The reversal of 2122443256455 is 5546523442212.
2122443256455 is a `hidden beast` number, since 2 + 1 + 2 + 2 + 4 + 4 + 32 + 564 + 55 = 666.
It is not a de Polignac number, because 2122443256455 - 29 = 2122443255943 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 2122443256455.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1025333872 + ... + 1025335941.
It is an arithmetic number, because the mean of its divisors is an integer number (159952245492).
Almost surely, 22122443256455 is an apocalyptic number.
2122443256455 is a deficient number, since it is larger than the sum of its proper divisors (1716410635353).
2122443256455 is a wasteful number, since it uses less digits than its factorization.
2122443256455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2050669847 (or 2050669844 counting only the distinct ones).
The product of its digits is 2304000, while the sum is 45.
Adding to 2122443256455 its reverse (5546523442212), we get a palindrome (7668966698667).
The spelling of 2122443256455 in words is "two trillion, one hundred twenty-two billion, four hundred forty-three million, two hundred fifty-six thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •