Base | Representation |
---|---|
bin | 111010100001000011011… |
… | …101111110010111000011 |
3 | 112020102110211100110102211 |
4 | 322201003131332113003 |
5 | 1011340430124221011 |
6 | 12315153520322551 |
7 | 563344420153111 |
oct | 72410335762703 |
9 | 15212424313384 |
10 | 4021221320131 |
11 | 1310432669574 |
12 | 54b40aa73457 |
13 | 232279520ab2 |
14 | dc8b1904ab1 |
15 | 6e904073b21 |
hex | 3a84377e5c3 |
4021221320131 has 2 divisors, whose sum is σ = 4021221320132. Its totient is φ = 4021221320130.
The previous prime is 4021221320113. The next prime is 4021221320161. The reversal of 4021221320131 is 1310231221204.
Together with previous prime (4021221320113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4021221320131 - 27 = 4021221320003 is a prime.
It is a super-2 number, since 2×40212213201312 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4021221320101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2010610660065 + 2010610660066.
It is an arithmetic number, because the mean of its divisors is an integer number (2010610660066).
Almost surely, 24021221320131 is an apocalyptic number.
4021221320131 is a deficient number, since it is larger than the sum of its proper divisors (1).
4021221320131 is an equidigital number, since it uses as much as digits as its factorization.
4021221320131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 4021221320131 its reverse (1310231221204), we get a palindrome (5331452541335).
The spelling of 4021221320131 in words is "four trillion, twenty-one billion, two hundred twenty-one million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •