Base | Representation |
---|---|
bin | 111010011000100100100… |
… | …010101100111100010101 |
3 | 112012112222000120001002121 |
4 | 322120210202230330111 |
5 | 1011213301301444341 |
6 | 12311050011335541 |
7 | 562602613553164 |
oct | 72304442547425 |
9 | 15175860501077 |
10 | 4012112531221 |
11 | 1307588a23653 |
12 | 5496a84515b1 |
13 | 231457370782 |
14 | dc289c913db |
15 | 6e56e5584d1 |
hex | 3a6248acf15 |
4012112531221 has 2 divisors, whose sum is σ = 4012112531222. Its totient is φ = 4012112531220.
The previous prime is 4012112531179. The next prime is 4012112531239. The reversal of 4012112531221 is 1221352112104.
4012112531221 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3265592339025 + 746520192196 = 1807095^2 + 864014^2 .
It is a cyclic number.
It is not a de Polignac number, because 4012112531221 - 27 = 4012112531093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4012112531321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2006056265610 + 2006056265611.
It is an arithmetic number, because the mean of its divisors is an integer number (2006056265611).
Almost surely, 24012112531221 is an apocalyptic number.
It is an amenable number.
4012112531221 is a deficient number, since it is larger than the sum of its proper divisors (1).
4012112531221 is an equidigital number, since it uses as much as digits as its factorization.
4012112531221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 4012112531221 its reverse (1221352112104), we get a palindrome (5233464643325).
The spelling of 4012112531221 in words is "four trillion, twelve billion, one hundred twelve million, five hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •