Base | Representation |
---|---|
bin | 11010101000111001… |
… | …10111100010011000 |
3 | 1100220201021110100210 |
4 | 31110130313202120 |
5 | 213242222134134 |
6 | 10323052131120 |
7 | 1014260626206 |
oct | 152434674230 |
9 | 40821243323 |
10 | 14301755544 |
11 | 6079a7168a |
12 | 2931766aa0 |
13 | 146bca2a5b |
14 | 9995c6076 |
15 | 58a88c2e9 |
hex | 354737898 |
14301755544 has 128 divisors (see below), whose sum is σ = 38054016000. Its totient is φ = 4466534400.
The previous prime is 14301755527. The next prime is 14301755579. The reversal of 14301755544 is 44555710341.
14301755544 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19890817 + ... + 19891535.
It is an arithmetic number, because the mean of its divisors is an integer number (297297000).
Almost surely, 214301755544 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14301755544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19027008000).
14301755544 is an abundant number, since it is smaller than the sum of its proper divisors (23752260456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14301755544 is a wasteful number, since it uses less digits than its factorization.
14301755544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1169 (or 1165 counting only the distinct ones).
The product of its (nonzero) digits is 168000, while the sum is 39.
The spelling of 14301755544 in words is "fourteen billion, three hundred one million, seven hundred fifty-five thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.159 sec. • engine limits •