Base | Representation |
---|---|
bin | 1000111101111001111… |
… | …1010111100001010001 |
3 | 112201122110201011111221 |
4 | 2033132133113201101 |
5 | 10011001443320423 |
6 | 154434520005041 |
7 | 14062444444024 |
oct | 2173637274121 |
9 | 481573634457 |
10 | 154056620113 |
11 | 5a375a44960 |
12 | 25a35300781 |
13 | 116b1b365a6 |
14 | 76564431bb |
15 | 4019cdae5d |
hex | 23de7d7851 |
154056620113 has 16 divisors (see below), whose sum is σ = 170964432576. Its totient is φ = 137642250240.
The previous prime is 154056619993. The next prime is 154056620119. The reversal of 154056620113 is 311026650451.
It is a de Polignac number, because none of the positive numbers 2k-154056620113 is a prime.
It is a super-2 number, since 2×1540566201132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (154056620119) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77745 + ... + 560497.
It is an arithmetic number, because the mean of its divisors is an integer number (10685277036).
Almost surely, 2154056620113 is an apocalyptic number.
It is an amenable number.
154056620113 is a deficient number, since it is larger than the sum of its proper divisors (16907812463).
154056620113 is a wasteful number, since it uses less digits than its factorization.
154056620113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 483264.
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 154056620113 in words is "one hundred fifty-four billion, fifty-six million, six hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •