Base | Representation |
---|---|
bin | 11011000011100100… |
… | …01010100101100111 |
3 | 1101111022011221001102 |
4 | 31201302022211213 |
5 | 214222003124112 |
6 | 10401202350315 |
7 | 1022645136410 |
oct | 154162124547 |
9 | 41438157042 |
10 | 14525442407 |
11 | 6184262963 |
12 | 299465b39b |
13 | 14a6431648 |
14 | 9bb1b2807 |
15 | 5a0324bc2 |
hex | 361c8a967 |
14525442407 has 8 divisors (see below), whose sum is σ = 16601248800. Its totient is φ = 12449821824.
The previous prime is 14525442389. The next prime is 14525442409. The reversal of 14525442407 is 70424452541.
14525442407 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14525442407 - 26 = 14525442343 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 (14525442409) 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 7 ways as a sum of consecutive naturals, for example, 233819 + ... + 289347.
It is an arithmetic number, because the mean of its divisors is an integer number (2075156100).
Almost surely, 214525442407 is an apocalyptic number.
14525442407 is a deficient number, since it is larger than the sum of its proper divisors (2075806393).
14525442407 is an equidigital number, since it uses as much as digits as its factorization.
14525442407 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92905.
The product of its (nonzero) digits is 179200, while the sum is 38.
Adding to 14525442407 its reverse (70424452541), we get a palindrome (84949894948).
The spelling of 14525442407 in words is "fourteen billion, five hundred twenty-five million, four hundred forty-two thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •