Base | Representation |
---|---|
bin | 11010010011100111… |
… | …11100010110100101 |
3 | 1100110021101200221010 |
4 | 31021303330112211 |
5 | 212411023131310 |
6 | 10253234212433 |
7 | 1006662455103 |
oct | 151163742645 |
9 | 40407350833 |
10 | 14123255205 |
11 | 5a98233744 |
12 | 28a1a24119 |
13 | 1441005657 |
14 | 97d9dcc73 |
15 | 579d7d320 |
hex | 349cfc5a5 |
14123255205 has 8 divisors (see below), whose sum is σ = 22597208352. Its totient is φ = 7532402768.
The previous prime is 14123255203. The next prime is 14123255221. The reversal of 14123255205 is 50255232141.
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 14123255205 - 21 = 14123255203 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14123255203) 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, 470775159 + ... + 470775188.
It is an arithmetic number, because the mean of its divisors is an integer number (2824651044).
Almost surely, 214123255205 is an apocalyptic number.
14123255205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14123255205 is a deficient number, since it is larger than the sum of its proper divisors (8473953147).
14123255205 is an equidigital number, since it uses as much as digits as its factorization.
14123255205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 941550355.
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 14123255205 its reverse (50255232141), we get a palindrome (64378487346).
The spelling of 14123255205 in words is "fourteen billion, one hundred twenty-three million, two hundred fifty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.946 sec. • engine limits •