Base | Representation |
---|---|
bin | 11101110100010011… |
… | …01011010111101000 |
3 | 1112022121212201002221 |
4 | 32322021223113220 |
5 | 230241022013000 |
6 | 11204243003424 |
7 | 1104456522565 |
oct | 167211532750 |
9 | 45277781087 |
10 | 16008001000 |
11 | 68751100a2 |
12 | 3129069574 |
13 | 1681627c54 |
14 | abc05586c |
15 | 63a57661a |
hex | 3ba26b5e8 |
16008001000 has 48 divisors (see below), whose sum is σ = 37468087020. Its totient is φ = 6401600000.
The previous prime is 16008000997. The next prime is 16008001001. The reversal of 16008001000 is 10080061.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 6 ways, for example, as 2473470756 + 13534530244 = 49734^2 + 116338^2 .
It is not an unprimeable number, because it can be changed into a prime (16008001001) 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 11 ways as a sum of consecutive naturals, for example, 3999000 + ... + 4003000.
Almost surely, 216008001000 is an apocalyptic number.
16008001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16008001000 is an abundant number, since it is smaller than the sum of its proper divisors (21460086020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16008001000 is an frugal number, since it uses more digits than its factorization.
16008001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8023 (or 4008 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 16008001000 its reverse (10080061), we get a palindrome (16018081061).
The spelling of 16008001000 in words is "sixteen billion, eight million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •