Base | Representation |
---|---|
bin | 10100100101000110011… |
… | …101010010001101011001 |
3 | 12000012100212022211211111 |
4 | 110211012131102031121 |
5 | 141132313414303030 |
6 | 3001404150100321 |
7 | 204113563253161 |
oct | 24450635221531 |
9 | 5005325284744 |
10 | 1414226322265 |
11 | 4a5851987819 |
12 | 1aa10564a6a1 |
13 | a3490088043 |
14 | 4c63db975a1 |
15 | 26bc209b62a |
hex | 14946752359 |
1414226322265 has 4 divisors (see below), whose sum is σ = 1697071586724. Its totient is φ = 1131381057808.
The previous prime is 1414226322263. The next prime is 1414226322293. The reversal of 1414226322265 is 5622236224141.
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 643840945609 + 770385376656 = 802397^2 + 877716^2 .
It is a cyclic number.
It is not a de Polignac number, because 1414226322265 - 21 = 1414226322263 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1414226322263) 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, 141422632222 + ... + 141422632231.
It is an arithmetic number, because the mean of its divisors is an integer number (424267896681).
Almost surely, 21414226322265 is an apocalyptic number.
It is an amenable number.
1414226322265 is a deficient number, since it is larger than the sum of its proper divisors (282845264459).
1414226322265 is an equidigital number, since it uses as much as digits as its factorization.
1414226322265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282845264458.
The product of its digits is 276480, while the sum is 40.
The spelling of 1414226322265 in words is "one trillion, four hundred fourteen billion, two hundred twenty-six million, three hundred twenty-two thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •