Base | Representation |
---|---|
bin | 1110100101101101101010… |
… | …1000000111001011110001 |
3 | 2002210111211011012020122120 |
4 | 3221123122220013023301 |
5 | 4100304110403102122 |
6 | 54041100221424453 |
7 | 3243633545562411 |
oct | 351333250071361 |
9 | 62714734166576 |
10 | 16041075831537 |
11 | 5124a89131689 |
12 | 1970a4ba0b129 |
13 | 8c4889408983 |
14 | 3d656c336641 |
15 | 1cc3ea07275c |
hex | e96daa072f1 |
16041075831537 has 16 divisors (see below), whose sum is σ = 21393202478592. Its totient is φ = 10691500135680.
The previous prime is 16041075831523. The next prime is 16041075831581. The reversal of 16041075831537 is 73513857014061.
It is not a de Polignac number, because 16041075831537 - 27 = 16041075831409 is a prime.
It is a super-2 number, since 2×160410758315372 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16041075831537.
It is not an unprimeable number, because it can be changed into a prime (16041075131537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 524597193 + ... + 524627769.
It is an arithmetic number, because the mean of its divisors is an integer number (1337075154912).
Almost surely, 216041075831537 is an apocalyptic number.
It is an amenable number.
16041075831537 is a deficient number, since it is larger than the sum of its proper divisors (5352126647055).
16041075831537 is a wasteful number, since it uses less digits than its factorization.
16041075831537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66568.
The product of its (nonzero) digits is 2116800, while the sum is 51.
The spelling of 16041075831537 in words is "sixteen trillion, forty-one billion, seventy-five million, eight hundred thirty-one thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •