Base | Representation |
---|---|
bin | 111010100001001010101… |
… | …111000110100001011001 |
3 | 112020102210022210011111012 |
4 | 322201022233012201121 |
5 | 1011341202333004041 |
6 | 12315213553543305 |
7 | 563350430434232 |
oct | 72411257064131 |
9 | 15212708704435 |
10 | 4021343250521 |
11 | 1310495479693 |
12 | 54b443874b35 |
13 | 23229887255c |
14 | dc8c3ba4089 |
15 | 6e90eb0b3eb |
hex | 3a84abc6859 |
4021343250521 has 2 divisors, whose sum is σ = 4021343250522. Its totient is φ = 4021343250520.
The previous prime is 4021343250517. The next prime is 4021343250553. The reversal of 4021343250521 is 1250523431204.
It is an a-pointer prime, because the next prime (4021343250553) can be obtained adding 4021343250521 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2983430562121 + 1037912688400 = 1727261^2 + 1018780^2 .
It is a cyclic number.
It is not a de Polignac number, because 4021343250521 - 22 = 4021343250517 is a prime.
It is not a weakly prime, because it can be changed into another prime (4021343250121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2010671625260 + 2010671625261.
It is an arithmetic number, because the mean of its divisors is an integer number (2010671625261).
Almost surely, 24021343250521 is an apocalyptic number.
It is an amenable number.
4021343250521 is a deficient number, since it is larger than the sum of its proper divisors (1).
4021343250521 is an equidigital number, since it uses as much as digits as its factorization.
4021343250521 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 4021343250521 its reverse (1250523431204), we get a palindrome (5271866681725).
The spelling of 4021343250521 in words is "four trillion, twenty-one billion, three hundred forty-three million, two hundred fifty thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •