Base | Representation |
---|---|
bin | 11011010000101000… |
… | …01101000010100101 |
3 | 1101202221101111002222 |
4 | 31220110031002211 |
5 | 214433031404040 |
6 | 10420115242125 |
7 | 1025445455666 |
oct | 155024150245 |
9 | 41687344088 |
10 | 14635028645 |
11 | 62301016a6 |
12 | 2a052a9345 |
13 | 14c3050583 |
14 | 9cb97b36d |
15 | 5a9c6ebb5 |
hex | 36850d0a5 |
14635028645 has 4 divisors (see below), whose sum is σ = 17562034380. Its totient is φ = 11708022912.
The previous prime is 14635028641. The next prime is 14635028693. The reversal of 14635028645 is 54682053641.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54682053641 = 443 ⋅123435787.
It can be written as a sum of positive squares in 2 ways, for example, as 4211231236 + 10423797409 = 64894^2 + 102097^2 .
It is a cyclic number.
It is not a de Polignac number, because 14635028645 - 22 = 14635028641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14635028596 and 14635028605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14635028641) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1463502860 + ... + 1463502869.
It is an arithmetic number, because the mean of its divisors is an integer number (4390508595).
Almost surely, 214635028645 is an apocalyptic number.
It is an amenable number.
14635028645 is a deficient number, since it is larger than the sum of its proper divisors (2927005735).
14635028645 is an equidigital number, since it uses as much as digits as its factorization.
14635028645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2927005734.
The product of its (nonzero) digits is 691200, while the sum is 44.
The spelling of 14635028645 in words is "fourteen billion, six hundred thirty-five million, twenty-eight thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •