Base | Representation |
---|---|
bin | 1110110110100110001101… |
… | …0001010100000110001101 |
3 | 2010211020111121102201201000 |
4 | 3231221203101110012031 |
5 | 4120032124033030131 |
6 | 54422230145410513 |
7 | 3303612440210505 |
oct | 355514321240615 |
9 | 63736447381630 |
10 | 16331131142541 |
11 | 5226aa2861946 |
12 | 19b90ba939a39 |
13 | 916032b44a07 |
14 | 4066067d2a05 |
15 | 1d4c2464bce6 |
hex | eda6345418d |
16331131142541 has 16 divisors (see below), whose sum is σ = 24205729489920. Its totient is φ = 10882263252960.
The previous prime is 16331131142509. The next prime is 16331131142549. The reversal of 16331131142541 is 14524113113361.
It is a happy number.
16331131142541 is a `hidden beast` number, since 1 + 6 + 3 + 311 + 311 + 4 + 25 + 4 + 1 = 666.
It is not a de Polignac number, because 16331131142541 - 25 = 16331131142509 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16331131142496 and 16331131142505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16331131142549) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 143206080 + ... + 143320073.
It is an arithmetic number, because the mean of its divisors is an integer number (1512858093120).
Almost surely, 216331131142541 is an apocalyptic number.
It is an amenable number.
16331131142541 is a deficient number, since it is larger than the sum of its proper divisors (7874598347379).
16331131142541 is a wasteful number, since it uses less digits than its factorization.
16331131142541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286528273 (or 286528267 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The spelling of 16331131142541 in words is "sixteen trillion, three hundred thirty-one billion, one hundred thirty-one million, one hundred forty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •