Base | Representation |
---|---|
bin | 11110100011101100… |
… | …01010110100100101 |
3 | 1120100022220210021112 |
4 | 33101312022310211 |
5 | 232044304241013 |
6 | 11311523354405 |
7 | 1120354535033 |
oct | 172166126445 |
9 | 46308823245 |
10 | 16405540133 |
11 | 6a59555134 |
12 | 321a222a05 |
13 | 1715ab73c8 |
14 | b18b79553 |
15 | 660400ba8 |
hex | 3d1d8ad25 |
16405540133 has 4 divisors (see below), whose sum is σ = 16405816140. Its totient is φ = 16405264128.
The previous prime is 16405540117. The next prime is 16405540147. The reversal of 16405540133 is 33104550461.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33104550461 = 13913 ⋅2379397.
It can be written as a sum of positive squares in 2 ways, for example, as 2973193729 + 13432346404 = 54527^2 + 115898^2 .
It is a cyclic number.
It is not a de Polignac number, because 16405540133 - 24 = 16405540117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16405540133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16405540183) 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, 8060 + ... + 181317.
It is an arithmetic number, because the mean of its divisors is an integer number (4101454035).
Almost surely, 216405540133 is an apocalyptic number.
It is an amenable number.
16405540133 is a deficient number, since it is larger than the sum of its proper divisors (276007).
16405540133 is an equidigital number, since it uses as much as digits as its factorization.
16405540133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 276006.
The product of its (nonzero) digits is 21600, while the sum is 32.
The spelling of 16405540133 in words is "sixteen billion, four hundred five million, five hundred forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •