Base | Representation |
---|---|
bin | 11110011010001010… |
… | …10100010110100101 |
3 | 1120010202112200200011 |
4 | 33031011110112211 |
5 | 231413330002003 |
6 | 11255550450221 |
7 | 1115364345040 |
oct | 171505242645 |
9 | 46122480604 |
10 | 16325625253 |
11 | 6a18431983 |
12 | 31b7503971 |
13 | 17023869b2 |
14 | b0c2d5c57 |
15 | 6583b746d |
hex | 3cd1545a5 |
16325625253 has 4 divisors (see below), whose sum is σ = 18657857440. Its totient is φ = 13993393068.
The previous prime is 16325625247. The next prime is 16325625269. The reversal of 16325625253 is 35252652361.
16325625253 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 a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 16325625253 - 217 = 16325494181 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 (16325625203) 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, 1166116083 + ... + 1166116096.
It is an arithmetic number, because the mean of its divisors is an integer number (4664464360).
Almost surely, 216325625253 is an apocalyptic number.
It is an amenable number.
16325625253 is a deficient number, since it is larger than the sum of its proper divisors (2332232187).
16325625253 is an equidigital number, since it uses as much as digits as its factorization.
16325625253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2332232186.
The product of its digits is 324000, while the sum is 40.
The spelling of 16325625253 in words is "sixteen billion, three hundred twenty-five million, six hundred twenty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •