Base | Representation |
---|---|
bin | 100000010100101011001… |
… | …0000010101000001000111 |
3 | 120201200201111211100211101 |
4 | 1000221112100111001013 |
5 | 1040241110441230111 |
6 | 13240455201320531 |
7 | 635645613023164 |
oct | 100512620250107 |
9 | 16650644740741 |
10 | 4442443305031 |
11 | 1463036482266 |
12 | 5b8b85336147 |
13 | 262bc7757c44 |
14 | 1150303a306b |
15 | 7a858b17bc1 |
hex | 40a56415047 |
4442443305031 has 2 divisors, whose sum is σ = 4442443305032. Its totient is φ = 4442443305030.
The previous prime is 4442443305029. The next prime is 4442443305049. The reversal of 4442443305031 is 1305033442444.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4442443305031 - 21 = 4442443305029 is a prime.
It is a super-2 number, since 2×44424433050312 (a number of 26 digits) contains 22 as substring.
Together with 4442443305029, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4442443305011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2221221652515 + 2221221652516.
It is an arithmetic number, because the mean of its divisors is an integer number (2221221652516).
Almost surely, 24442443305031 is an apocalyptic number.
4442443305031 is a deficient number, since it is larger than the sum of its proper divisors (1).
4442443305031 is an equidigital number, since it uses as much as digits as its factorization.
4442443305031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 276480, while the sum is 37.
Adding to 4442443305031 its reverse (1305033442444), we get a palindrome (5747476747475).
It can be divided in two parts, 4442443 and 305031, that added together give a palindrome (4747474).
The spelling of 4442443305031 in words is "four trillion, four hundred forty-two billion, four hundred forty-three million, three hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •