Base | Representation |
---|---|
bin | 1101010000100011010… |
… | …11010101001100100101 |
3 | 1121112212222100120002212 |
4 | 12220101223111030211 |
5 | 24430443123330221 |
6 | 545141030213205 |
7 | 44625164333651 |
oct | 6502153251445 |
9 | 1545788316085 |
10 | 455563105061 |
11 | 166226550639 |
12 | 7435b1b4205 |
13 | 33c61ab80bc |
14 | 18099695a61 |
15 | bcb4875b5b |
hex | 6a11ad5325 |
455563105061 has 4 divisors (see below), whose sum is σ = 467875621452. Its totient is φ = 443250588672.
The previous prime is 455563105033. The next prime is 455563105069. The reversal of 455563105061 is 160501365554.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 160501365554 = 2 ⋅80250682777.
It can be written as a sum of positive squares in 2 ways, for example, as 176811840100 + 278751264961 = 420490^2 + 527969^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-455563105061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (455563105069) 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, 6156258140 + ... + 6156258213.
It is an arithmetic number, because the mean of its divisors is an integer number (116968905363).
Almost surely, 2455563105061 is an apocalyptic number.
It is an amenable number.
455563105061 is a deficient number, since it is larger than the sum of its proper divisors (12312516391).
455563105061 is a wasteful number, since it uses less digits than its factorization.
455563105061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12312516390.
The product of its (nonzero) digits is 270000, while the sum is 41.
The spelling of 455563105061 in words is "four hundred fifty-five billion, five hundred sixty-three million, one hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •