Base | Representation |
---|---|
bin | 10100011000111110110… |
… | …111101001100101011101 |
3 | 11221221210000120011222021 |
4 | 110120332313221211131 |
5 | 140424141303123031 |
6 | 2551413041220141 |
7 | 203143251311302 |
oct | 24307667514535 |
9 | 4857700504867 |
10 | 1401214114141 |
11 | 4a0284924206 |
12 | 1a7693931651 |
13 | a21983006ca |
14 | 4bb679710a9 |
15 | 266aea37511 |
hex | 1463ede995d |
1401214114141 has 4 divisors (see below), whose sum is σ = 1401540209692. Its totient is φ = 1400888018592.
The previous prime is 1401214114099. The next prime is 1401214114151. The reversal of 1401214114141 is 1414114121041.
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 851844086116 + 549370028025 = 922954^2 + 741195^2 .
It is a cyclic number.
It is not a de Polignac number, because 1401214114141 - 215 = 1401214081373 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 (1401214114151) 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, 163041330 + ... + 163049923.
It is an arithmetic number, because the mean of its divisors is an integer number (350385052423).
Almost surely, 21401214114141 is an apocalyptic number.
It is an amenable number.
1401214114141 is a deficient number, since it is larger than the sum of its proper divisors (326095551).
1401214114141 is an equidigital number, since it uses as much as digits as its factorization.
1401214114141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 326095550.
The product of its (nonzero) digits is 512, while the sum is 25.
Adding to 1401214114141 its reverse (1414114121041), we get a palindrome (2815328235182).
The spelling of 1401214114141 in words is "one trillion, four hundred one billion, two hundred fourteen million, one hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •