Base | Representation |
---|---|
bin | 11010000110010001… |
… | …00100101000001101 |
3 | 1100011110120212000012 |
4 | 31003020210220031 |
5 | 212143333110131 |
6 | 10234153043005 |
7 | 1004132266211 |
oct | 150310445015 |
9 | 40143525005 |
10 | 14011222541 |
11 | 5a3aa73968 |
12 | 28703b6465 |
13 | 1423a3b034 |
14 | 96cb98941 |
15 | 5700ed52b |
hex | 343224a0d |
14011222541 has 8 divisors (see below), whose sum is σ = 14035495320. Its totient is φ = 13986968128.
The previous prime is 14011222417. The next prime is 14011222543. The reversal of 14011222541 is 14522211041.
It can be written as a sum of positive squares in 4 ways, for example, as 6157540900 + 7853681641 = 78470^2 + 88621^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 14011222541 - 222 = 14007028237 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 (14011222543) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3311015 + ... + 3315243.
It is an arithmetic number, because the mean of its divisors is an integer number (1754436915).
Almost surely, 214011222541 is an apocalyptic number.
It is an amenable number.
14011222541 is a deficient number, since it is larger than the sum of its proper divisors (24272779).
14011222541 is an equidigital number, since it uses as much as digits as its factorization.
14011222541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9183.
The product of its (nonzero) digits is 640, while the sum is 23.
Adding to 14011222541 its reverse (14522211041), we get a palindrome (28533433582).
The spelling of 14011222541 in words is "fourteen billion, eleven million, two hundred twenty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •