Base | Representation |
---|---|
bin | 111010100001000100000… |
… | …011110010011111110101 |
3 | 112020102111112000002100121 |
4 | 322201010003302133311 |
5 | 1011340440143424023 |
6 | 12315154513011541 |
7 | 563344600340461 |
oct | 72410403623765 |
9 | 15212445002317 |
10 | 4021231233013 |
11 | 131043821a235 |
12 | 54b412253bb1 |
13 | 23227b5b1ac7 |
14 | dc8b2d654a1 |
15 | 6e904d80d5d |
hex | 3a8440f27f5 |
4021231233013 has 2 divisors, whose sum is σ = 4021231233014. Its totient is φ = 4021231233012.
The previous prime is 4021231232999. The next prime is 4021231233023. The reversal of 4021231233013 is 3103321321204.
4021231233013 is digitally balanced in base 2, 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., 3344886183409 + 676345049604 = 1828903^2 + 822402^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4021231233013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4021231233023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2010615616506 + 2010615616507.
It is an arithmetic number, because the mean of its divisors is an integer number (2010615616507).
Almost surely, 24021231233013 is an apocalyptic number.
It is an amenable number.
4021231233013 is a deficient number, since it is larger than the sum of its proper divisors (1).
4021231233013 is an equidigital number, since it uses as much as digits as its factorization.
4021231233013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 4021231233013 its reverse (3103321321204), we get a palindrome (7124552554217).
The spelling of 4021231233013 in words is "four trillion, twenty-one billion, two hundred thirty-one million, two hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •