Base | Representation |
---|---|
bin | 1110111110001010001101… |
… | …1000001100000100111101 |
3 | 2011021122212021102101000211 |
4 | 3233202203120030010331 |
5 | 4124144220230033110 |
6 | 55002034331552421 |
7 | 3316162206604513 |
oct | 357424330140475 |
9 | 64248767371024 |
10 | 16461055705405 |
11 | 5277104896a33 |
12 | 1a1a31a2bb711 |
13 | 92536a1c5c8c |
14 | 40ca0dc624b3 |
15 | 1d82caa5d98a |
hex | ef8a360c13d |
16461055705405 has 4 divisors (see below), whose sum is σ = 19753266846492. Its totient is φ = 13168844564320.
The previous prime is 16461055705397. The next prime is 16461055705411. The reversal of 16461055705405 is 50450755016461.
16461055705405 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 can be written as a sum of positive squares in 2 ways, for example, as 4624297574724 + 11836758130681 = 2150418^2 + 3440459^2 .
It is not a de Polignac number, because 16461055705405 - 23 = 16461055705397 is a prime.
It is a Duffinian number.
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, 1646105570536 + ... + 1646105570545.
It is an arithmetic number, because the mean of its divisors is an integer number (4938316711623).
Almost surely, 216461055705405 is an apocalyptic number.
It is an amenable number.
16461055705405 is a deficient number, since it is larger than the sum of its proper divisors (3292211141087).
16461055705405 is an equidigital number, since it uses as much as digits as its factorization.
16461055705405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3292211141086.
The product of its (nonzero) digits is 2520000, while the sum is 49.
The spelling of 16461055705405 in words is "sixteen trillion, four hundred sixty-one billion, fifty-five million, seven hundred five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •