Base | Representation |
---|---|
bin | 11101110100111011… |
… | …01000100100011011 |
3 | 1112022222201111020220 |
4 | 32322131220210123 |
5 | 230243341414121 |
6 | 11204551051123 |
7 | 1104552141531 |
oct | 167235504433 |
9 | 45288644226 |
10 | 16013232411 |
11 | 6878063580 |
12 | 312a970aa3 |
13 | 168273a167 |
14 | abca18151 |
15 | 63ac5b6c6 |
hex | 3ba76891b |
16013232411 has 8 divisors (see below), whose sum is σ = 23291974464. Its totient is φ = 9704989320.
The previous prime is 16013232409. The next prime is 16013232437. The reversal of 16013232411 is 11423231061.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16013232411 - 21 = 16013232409 is a prime.
It is a super-2 number, since 2×160132324112 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16013232451) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 242624701 + ... + 242624766.
It is an arithmetic number, because the mean of its divisors is an integer number (2911496808).
Almost surely, 216013232411 is an apocalyptic number.
16013232411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
16013232411 is a deficient number, since it is larger than the sum of its proper divisors (7278742053).
16013232411 is a wasteful number, since it uses less digits than its factorization.
16013232411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485249481.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 16013232411 its reverse (11423231061), we get a palindrome (27436463472).
The spelling of 16013232411 in words is "sixteen billion, thirteen million, two hundred thirty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •