Base | Representation |
---|---|
bin | 11010011110010101… |
… | …10110001111001001 |
3 | 1100200112112121021222 |
4 | 31033022312033021 |
5 | 213102031124140 |
6 | 10310205011425 |
7 | 1012133513054 |
oct | 151712661711 |
9 | 40615477258 |
10 | 14213145545 |
11 | 6033a4a685 |
12 | 2907b53b75 |
13 | 14568196c1 |
14 | 98b91ba9b |
15 | 582bd75b5 |
hex | 34f2b63c9 |
14213145545 has 8 divisors (see below), whose sum is σ = 18059055624. Its totient is φ = 10701662464.
The previous prime is 14213145451. The next prime is 14213145547. The reversal of 14213145545 is 54554131241.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 172554496 + 14040591049 = 13136^2 + 118493^2 .
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 14213145545 - 216 = 14213080009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14213145547) 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 7 ways as a sum of consecutive naturals, for example, 83606654 + ... + 83606823.
It is an arithmetic number, because the mean of its divisors is an integer number (2257381953).
Almost surely, 214213145545 is an apocalyptic number.
It is an amenable number.
14213145545 is a deficient number, since it is larger than the sum of its proper divisors (3845910079).
14213145545 is a wasteful number, since it uses less digits than its factorization.
14213145545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167213499.
The product of its digits is 48000, while the sum is 35.
Adding to 14213145545 its reverse (54554131241), we get a palindrome (68767276786).
The spelling of 14213145545 in words is "fourteen billion, two hundred thirteen million, one hundred forty-five thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •