Base | Representation |
---|---|
bin | 100000000111101010111101… |
… | …000100100101101010111101 |
3 | 200112011202202002200012010021 |
4 | 200013222331010211222331 |
5 | 122003434443443242031 |
6 | 1220240025505412141 |
7 | 41520014425613506 |
oct | 4007527504455275 |
9 | 615152662605107 |
10 | 141264646462141 |
11 | 41014000191154 |
12 | 13a1605033a051 |
13 | 60a927828c867 |
14 | 26c536141bbad |
15 | 114e93e7e9511 |
hex | 807abd125abd |
141264646462141 has 16 divisors (see below), whose sum is σ = 145380821428224. Its totient is φ = 137223434444544.
The previous prime is 141264646462133. The next prime is 141264646462151.
It is a happy number.
141264646462141 is nontrivially palindromic in base 10.
141264646462141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 141264646462141 - 23 = 141264646462133 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 (141264646462151) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54340315 + ... + 56880568.
It is an arithmetic number, because the mean of its divisors is an integer number (9086301339264).
Almost surely, 2141264646462141 is an apocalyptic number.
It is an amenable number.
141264646462141 is a deficient number, since it is larger than the sum of its proper divisors (4116174966083).
141264646462141 is a wasteful number, since it uses less digits than its factorization.
141264646462141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111221220.
The product of its digits is 5308416, while the sum is 52.
The spelling of 141264646462141 in words is "one hundred forty-one trillion, two hundred sixty-four billion, six hundred forty-six million, four hundred sixty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •