Base | Representation |
---|---|
bin | 11110011100100011… |
… | …10000101100000111 |
3 | 1120012011020210000201 |
4 | 33032101300230013 |
5 | 231433442224023 |
6 | 11301544151331 |
7 | 1116026565565 |
oct | 171621605407 |
9 | 46164223021 |
10 | 16345664263 |
11 | 6a28779545 |
12 | 3202168547 |
13 | 1706581ab6 |
14 | b10c30a35 |
15 | 65a024bad |
hex | 3ce470b07 |
16345664263 has 4 divisors (see below), whose sum is σ = 16622709480. Its totient is φ = 16068619048.
The previous prime is 16345664239. The next prime is 16345664267. The reversal of 16345664263 is 36246654361.
16345664263 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 36246654361 = 3823 ⋅9481207.
It is a cyclic number.
It is not a de Polignac number, because 16345664263 - 225 = 16312109831 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16345664267) 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 3 ways as a sum of consecutive naturals, for example, 138522520 + ... + 138522637.
It is an arithmetic number, because the mean of its divisors is an integer number (4155677370).
Almost surely, 216345664263 is an apocalyptic number.
16345664263 is a deficient number, since it is larger than the sum of its proper divisors (277045217).
16345664263 is an equidigital number, since it uses as much as digits as its factorization.
16345664263 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277045216.
The product of its digits is 1866240, while the sum is 46.
The spelling of 16345664263 in words is "sixteen billion, three hundred forty-five million, six hundred sixty-four thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •