Base | Representation |
---|---|
bin | 10011101010100100011100… |
… | …11011001000100111111101 |
3 | 12200010002122002110001211111 |
4 | 21311102032123020213331 |
5 | 21132002424233322023 |
6 | 231550024035122021 |
7 | 12052166416634305 |
oct | 1165221633104775 |
9 | 180102562401744 |
10 | 43244120214013 |
11 | 12862801541834 |
12 | 4a25000443311 |
13 | 1b18b97c8ac34 |
14 | a97052d48605 |
15 | 4eed2ae8b00d |
hex | 27548e6c89fd |
43244120214013 has 2 divisors, whose sum is σ = 43244120214014. Its totient is φ = 43244120214012.
The previous prime is 43244120214011. The next prime is 43244120214067. The reversal of 43244120214013 is 31041202144234.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 33333221421049 + 9910898792964 = 5773493^2 + 3148158^2 .
It is a cyclic number.
It is not a de Polignac number, because 43244120214013 - 21 = 43244120214011 is a prime.
Together with 43244120214011, 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 (43244120214011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21622060107006 + 21622060107007.
It is an arithmetic number, because the mean of its divisors is an integer number (21622060107007).
Almost surely, 243244120214013 is an apocalyptic number.
It is an amenable number.
43244120214013 is a deficient number, since it is larger than the sum of its proper divisors (1).
43244120214013 is an equidigital number, since it uses as much as digits as its factorization.
43244120214013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 43244120214013 its reverse (31041202144234), we get a palindrome (74285322358247).
The spelling of 43244120214013 in words is "forty-three trillion, two hundred forty-four billion, one hundred twenty million, two hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •