Base | Representation |
---|---|
bin | 11011000011100100… |
… | …10010100111110001 |
3 | 1101111022020121012011 |
4 | 31201302102213301 |
5 | 214222010202223 |
6 | 10401203202521 |
7 | 1022645334346 |
oct | 154162224761 |
9 | 41438217164 |
10 | 14525475313 |
11 | 6184285658 |
12 | 2994676441 |
13 | 14a644360b |
14 | 9bb1c07cd |
15 | 5a032e80d |
hex | 361c929f1 |
14525475313 has 4 divisors (see below), whose sum is σ = 14742273520. Its totient is φ = 14308677108.
The previous prime is 14525475301. The next prime is 14525475329. The reversal of 14525475313 is 31357452541.
14525475313 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 14525475313 - 29 = 14525474801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14525475373) 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, 108399003 + ... + 108399136.
It is an arithmetic number, because the mean of its divisors is an integer number (3685568380).
Almost surely, 214525475313 is an apocalyptic number.
It is an amenable number.
14525475313 is a deficient number, since it is larger than the sum of its proper divisors (216798207).
14525475313 is an equidigital number, since it uses as much as digits as its factorization.
14525475313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216798206.
The product of its digits is 252000, while the sum is 40.
The spelling of 14525475313 in words is "fourteen billion, five hundred twenty-five million, four hundred seventy-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •