Base | Representation |
---|---|
bin | 1000111111100110010… |
… | …1111000000010100101 |
3 | 112202211011021212011122 |
4 | 2033321211320002211 |
5 | 10012414343423023 |
6 | 154552001343325 |
7 | 14106635321333 |
oct | 2177145700245 |
9 | 482734255148 |
10 | 154511311013 |
11 | 5a589674964 |
12 | 25b41637b45 |
13 | 117550b6467 |
14 | 769a9a2b53 |
15 | 4044ba42c8 |
hex | 23f99780a5 |
154511311013 has 16 divisors (see below), whose sum is σ = 155855875200. Its totient is φ = 153173514240.
The previous prime is 154511310917. The next prime is 154511311021. The reversal of 154511311013 is 310113115451.
154511311013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 154511311013 - 218 = 154511048869 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (154516311013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 100921058 + ... + 100922588.
It is an arithmetic number, because the mean of its divisors is an integer number (9740992200).
Almost surely, 2154511311013 is an apocalyptic number.
It is an amenable number.
154511311013 is a deficient number, since it is larger than the sum of its proper divisors (1344564187).
154511311013 is a wasteful number, since it uses less digits than its factorization.
154511311013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3212.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 154511311013 its reverse (310113115451), we get a palindrome (464624426464).
The spelling of 154511311013 in words is "one hundred fifty-four billion, five hundred eleven million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •