Base | Representation |
---|---|
bin | 11011101110000001… |
… | …00100101101011100 |
3 | 1102102010020121102120 |
4 | 31313000210231130 |
5 | 220434133302311 |
6 | 10500403022540 |
7 | 1034531003532 |
oct | 156700445534 |
9 | 42363217376 |
10 | 14881540956 |
11 | 6347272a87 |
12 | 2a7396aa50 |
13 | 1532141649 |
14 | a125ca152 |
15 | 5c1715706 |
hex | 377024b5c |
14881540956 has 24 divisors (see below), whose sum is σ = 35081573520. Its totient is φ = 4909373952.
The previous prime is 14881540909. The next prime is 14881540967. The reversal of 14881540956 is 65904518841.
It is a happy number.
14881540956 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×148815409562 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14881540899 and 14881540908.
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 7 ways as a sum of consecutive naturals, for example, 6391251 + ... + 6393578.
It is an arithmetic number, because the mean of its divisors is an integer number (1461732230).
Almost surely, 214881540956 is an apocalyptic number.
It is an amenable number.
14881540956 is an abundant number, since it is smaller than the sum of its proper divisors (20200032564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14881540956 is a wasteful number, since it uses less digits than its factorization.
14881540956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12784933 (or 12784931 counting only the distinct ones).
The product of its (nonzero) digits is 1382400, while the sum is 51.
The spelling of 14881540956 in words is "fourteen billion, eight hundred eighty-one million, five hundred forty thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •