Base | Representation |
---|---|
bin | 111001010000000101… |
… | …000111001001111111 |
3 | 12212200011101222102211 |
4 | 321100011013021333 |
5 | 2001344100400310 |
6 | 44123525001251 |
7 | 4304234245453 |
oct | 712005071177 |
9 | 185604358384 |
10 | 61473059455 |
11 | 24085a37475 |
12 | bab7253227 |
13 | 5a489a8bc2 |
14 | 2d92382663 |
15 | 18ebc29c8a |
hex | e5014727f |
61473059455 has 4 divisors (see below), whose sum is σ = 73767671352. Its totient is φ = 49178447560.
The previous prime is 61473059449. The next prime is 61473059497. The reversal of 61473059455 is 55495037416.
61473059455 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-61473059455 is a prime.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61473059399 and 61473059408.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6147305941 + ... + 6147305950.
It is an arithmetic number, because the mean of its divisors is an integer number (18441917838).
Almost surely, 261473059455 is an apocalyptic number.
61473059455 is a deficient number, since it is larger than the sum of its proper divisors (12294611897).
61473059455 is a wasteful number, since it uses less digits than its factorization.
61473059455 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12294611896.
The product of its (nonzero) digits is 2268000, while the sum is 49.
The spelling of 61473059455 in words is "sixty-one billion, four hundred seventy-three million, fifty-nine thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •