Base | Representation |
---|---|
bin | 1001110000011100000101… |
… | …00101001010001000110111 |
3 | 2210222010112100010202110120 |
4 | 10320032002211022020313 |
5 | 10303011432410004310 |
6 | 113344313354023023 |
7 | 4343053406333154 |
oct | 470160245121067 |
9 | 83863470122416 |
10 | 21455552422455 |
11 | 6922280aa7568 |
12 | 24a6291117a73 |
13 | bc83330971a8 |
14 | 54265077922b |
15 | 273195062b70 |
hex | 13838294a237 |
21455552422455 has 8 divisors (see below), whose sum is σ = 34328883875952. Its totient is φ = 11442961291968.
The previous prime is 21455552422433. The next prime is 21455552422519. The reversal of 21455552422455 is 55422425555412.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21455552422455 - 29 = 21455552421943 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21455552422398 and 21455552422407.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 715185080734 + ... + 715185080763.
It is an arithmetic number, because the mean of its divisors is an integer number (4291110484494).
Almost surely, 221455552422455 is an apocalyptic number.
21455552422455 is a deficient number, since it is larger than the sum of its proper divisors (12873331453497).
21455552422455 is a wasteful number, since it uses less digits than its factorization.
21455552422455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1430370161505.
The product of its digits is 16000000, while the sum is 51.
Adding to 21455552422455 its reverse (55422425555412), we get a palindrome (76877977977867).
The spelling of 21455552422455 in words is "twenty-one trillion, four hundred fifty-five billion, five hundred fifty-two million, four hundred twenty-two thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •