Base | Representation |
---|---|
bin | 11110001111001000… |
… | …11000001101110001 |
3 | 1112220022110010201000 |
4 | 33013210120031301 |
5 | 231221133313431 |
6 | 11242443432213 |
7 | 1113162052344 |
oct | 170744301561 |
9 | 45808403630 |
10 | 16233104241 |
11 | 6980189532 |
12 | 3190525669 |
13 | 16b9161433 |
14 | addcd045b |
15 | 6501dd9e6 |
hex | 3c7918371 |
16233104241 has 32 divisors (see below), whose sum is σ = 24462397440. Its totient is φ = 10636995600.
The previous prime is 16233104231. The next prime is 16233104249. The reversal of 16233104241 is 14240133261.
It is a happy number.
16233104241 is a `hidden beast` number, since 1 + 6 + 233 + 1 + 0 + 424 + 1 = 666.
16233104241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 16233104241 - 233 = 7643169649 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (16233104249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 621736 + ... + 647318.
It is an arithmetic number, because the mean of its divisors is an integer number (764449920).
Almost surely, 216233104241 is an apocalyptic number.
It is an amenable number.
16233104241 is a deficient number, since it is larger than the sum of its proper divisors (8229293199).
16233104241 is a wasteful number, since it uses less digits than its factorization.
16233104241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25994 (or 25988 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
The spelling of 16233104241 in words is "sixteen billion, two hundred thirty-three million, one hundred four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •