Base | Representation |
---|---|
bin | 11101010111011110… |
… | …00011100011001100 |
3 | 1111200202202221202001 |
4 | 32223233003203030 |
5 | 224242113004012 |
6 | 11124243042044 |
7 | 1065461663020 |
oct | 165357034314 |
9 | 44622687661 |
10 | 15766141132 |
11 | 6760637205 |
12 | 3080070324 |
13 | 16434a56c1 |
14 | a97c98380 |
15 | 6241ee357 |
hex | 3abbc38cc |
15766141132 has 12 divisors (see below), whose sum is σ = 31532282320. Its totient is φ = 6756917616.
The previous prime is 15766141099. The next prime is 15766141147. The reversal of 15766141132 is 23114166751.
15766141132 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 15766141091 and 15766141100.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 281538207 + ... + 281538262.
Almost surely, 215766141132 is an apocalyptic number.
It is an amenable number.
15766141132 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15766141132 is a wasteful number, since it uses less digits than its factorization.
15766141132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 563076480 (or 563076478 counting only the distinct ones).
The product of its digits is 30240, while the sum is 37.
The spelling of 15766141132 in words is "fifteen billion, seven hundred sixty-six million, one hundred forty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •