Base | Representation |
---|---|
bin | 10100101100101010001… |
… | …010010001101111001101 |
3 | 12000222022102111012112111 |
4 | 110230222022101233031 |
5 | 141300423411342031 |
6 | 3005225322504021 |
7 | 204521643241654 |
oct | 24545212215715 |
9 | 5028272435474 |
10 | 1422341512141 |
11 | 4a9236781010 |
12 | 1ab7ab365011 |
13 | a418442c844 |
14 | 4cbad88819b |
15 | 26ee974c1b1 |
hex | 14b2a291bcd |
1422341512141 has 8 divisors (see below), whose sum is σ = 1642918538304. Its totient is φ = 1216976694720.
The previous prime is 1422341512133. The next prime is 1422341512187. The reversal of 1422341512141 is 1412151432241.
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 1422341512141 - 23 = 1422341512133 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 (1422341512741) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3803051985 + ... + 3803052358.
It is an arithmetic number, because the mean of its divisors is an integer number (205364817288).
Almost surely, 21422341512141 is an apocalyptic number.
1422341512141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1422341512141 is a deficient number, since it is larger than the sum of its proper divisors (220577026163).
1422341512141 is a wasteful number, since it uses less digits than its factorization.
1422341512141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7606104371.
The product of its digits is 7680, while the sum is 31.
Adding to 1422341512141 its reverse (1412151432241), we get a palindrome (2834492944382).
The spelling of 1422341512141 in words is "one trillion, four hundred twenty-two billion, three hundred forty-one million, five hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •