Base | Representation |
---|---|
bin | 1000111101111001011… |
… | …1110011000111101101 |
3 | 112201122022222100211202 |
4 | 2033132113303013231 |
5 | 10011000441323023 |
6 | 154434405255245 |
7 | 14062421541335 |
oct | 2173627630755 |
9 | 481568870752 |
10 | 154054636013 |
11 | 5a37490a203 |
12 | 25a34704525 |
13 | 116b15c0475 |
14 | 76560880c5 |
15 | 4019a48128 |
hex | 23de5f31ed |
154054636013 has 4 divisors (see below), whose sum is σ = 154699216320. Its totient is φ = 153410055708.
The previous prime is 154054636009. The next prime is 154054636039. The reversal of 154054636013 is 310636450451.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310636450451 = 227 ⋅1368442513.
It is a cyclic number.
It is not a de Polignac number, because 154054636013 - 22 = 154054636009 is a prime.
It is a super-3 number, since 3×1540546360133 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (154054636213) 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, 322289795 + ... + 322290272.
It is an arithmetic number, because the mean of its divisors is an integer number (38674804080).
Almost surely, 2154054636013 is an apocalyptic number.
It is an amenable number.
154054636013 is a deficient number, since it is larger than the sum of its proper divisors (644580307).
154054636013 is an equidigital number, since it uses as much as digits as its factorization.
154054636013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 644580306.
The product of its (nonzero) digits is 129600, while the sum is 38.
The spelling of 154054636013 in words is "one hundred fifty-four billion, fifty-four million, six hundred thirty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •