Base | Representation |
---|---|
bin | 100000000111000001100111… |
… | …100011011000101111111101 |
3 | 200112000112011212112000122010 |
4 | 200013001213203120233331 |
5 | 122002223044034202031 |
6 | 1220203405345041433 |
7 | 41513553512242011 |
oct | 4007014743305775 |
9 | 615015155460563 |
10 | 141220262022141 |
11 | 40aa71a4341485 |
12 | 13a09524026279 |
13 | 60a5023a64803 |
14 | 26c3150826541 |
15 | 114d6e2e4e246 |
hex | 8070678d8bfd |
141220262022141 has 32 divisors (see below), whose sum is σ = 200663200972800. Its totient is φ = 88136412957824.
The previous prime is 141220262022127. The next prime is 141220262022157.
141220262022141 is nontrivially palindromic in base 10.
141220262022141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 141220262022141 - 25 = 141220262022109 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 141220262022099 and 141220262022108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (141220262026141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 338357401 + ... + 338774513.
It is an arithmetic number, because the mean of its divisors is an integer number (6270725030400).
Almost surely, 2141220262022141 is an apocalyptic number.
It is an amenable number.
141220262022141 is a deficient number, since it is larger than the sum of its proper divisors (59442938950659).
141220262022141 is a wasteful number, since it uses less digits than its factorization.
141220262022141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 521585.
The product of its (nonzero) digits is 6144, while the sum is 30.
The spelling of 141220262022141 in words is "one hundred forty-one trillion, two hundred twenty billion, two hundred sixty-two million, twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •