Base | Representation |
---|---|
bin | 11010101011110010… |
… | …01101011001100101 |
3 | 1100222101211021211211 |
4 | 31111321031121211 |
5 | 213314421243331 |
6 | 10325315031421 |
7 | 1015003446025 |
oct | 152571153145 |
9 | 40871737754 |
10 | 14325962341 |
11 | 60916a55a9 |
12 | 293989b571 |
13 | 1473cc9bc2 |
14 | 99c8c7a85 |
15 | 58ca6e8b1 |
hex | 355e4d665 |
14325962341 has 4 divisors (see below), whose sum is σ = 14486928300. Its totient is φ = 14164996384.
The previous prime is 14325962309. The next prime is 14325962347. The reversal of 14325962341 is 14326952341.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10058084100 + 4267878241 = 100290^2 + 65329^2 .
It is a cyclic number.
It is not a de Polignac number, because 14325962341 - 25 = 14325962309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14325962294 and 14325962303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14325962347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80482846 + ... + 80483023.
It is an arithmetic number, because the mean of its divisors is an integer number (3621732075).
Almost surely, 214325962341 is an apocalyptic number.
It is an amenable number.
14325962341 is a deficient number, since it is larger than the sum of its proper divisors (160965959).
14325962341 is an equidigital number, since it uses as much as digits as its factorization.
14325962341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160965958.
The product of its digits is 155520, while the sum is 40.
The spelling of 14325962341 in words is "fourteen billion, three hundred twenty-five million, nine hundred sixty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •