Base | Representation |
---|---|
bin | 11110011000111011… |
… | …01111100111000101 |
3 | 1120010001000122001210 |
4 | 33030131233213011 |
5 | 231403201014031 |
6 | 11254540242033 |
7 | 1115210226600 |
oct | 171435574705 |
9 | 46101018053 |
10 | 16315251141 |
11 | 6a12596732 |
12 | 31b3b40319 |
13 | 1700193a77 |
14 | b0ab95337 |
15 | 657518746 |
hex | 3cc76f9c5 |
16315251141 has 48 divisors (see below), whose sum is σ = 25908387840. Its totient is φ = 9101806560.
The previous prime is 16315251107. The next prime is 16315251167. The reversal of 16315251141 is 14115251361.
It is not a de Polignac number, because 16315251141 - 213 = 16315242949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16315251099 and 16315251108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16315251041) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2975040 + ... + 2980518.
It is an arithmetic number, because the mean of its divisors is an integer number (539758080).
Almost surely, 216315251141 is an apocalyptic number.
It is an amenable number.
16315251141 is a deficient number, since it is larger than the sum of its proper divisors (9593136699).
16315251141 is a wasteful number, since it uses less digits than its factorization.
16315251141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5974 (or 5967 counting only the distinct ones).
The product of its digits is 3600, while the sum is 30.
The spelling of 16315251141 in words is "sixteen billion, three hundred fifteen million, two hundred fifty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •