Base | Representation |
---|---|
bin | 11101111111010100… |
… | …11001100111101011 |
3 | 1112120001212101001101 |
4 | 32333222121213223 |
5 | 230433204341011 |
6 | 11221344502231 |
7 | 1106661460402 |
oct | 167752314753 |
9 | 45501771041 |
10 | 16100465131 |
11 | 6912324833 |
12 | 315401a977 |
13 | 169783065a |
14 | aca444639 |
15 | 64373d2c1 |
hex | 3bfa999eb |
16100465131 has 8 divisors (see below), whose sum is σ = 16139287584. Its totient is φ = 16061670720.
The previous prime is 16100465099. The next prime is 16100465201. The reversal of 16100465131 is 13156400161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 16100465131 - 25 = 16100465099 is a prime.
It is a super-2 number, since 2×161004651312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16100465131.
It is not an unprimeable number, because it can be changed into a prime (16100465231) 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 7 ways as a sum of consecutive naturals, for example, 1534455 + ... + 1544911.
It is an arithmetic number, because the mean of its divisors is an integer number (2017410948).
Almost surely, 216100465131 is an apocalyptic number.
16100465131 is a deficient number, since it is larger than the sum of its proper divisors (38822453).
16100465131 is a wasteful number, since it uses less digits than its factorization.
16100465131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14021.
The product of its (nonzero) digits is 2160, while the sum is 28.
Adding to 16100465131 its reverse (13156400161), we get a palindrome (29256865292).
The spelling of 16100465131 in words is "sixteen billion, one hundred million, four hundred sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •