Base | Representation |
---|---|
bin | 1011111000111001111001… |
… | …0110000101100100111001 |
3 | 1201021200202000201000112210 |
4 | 2332032132112011210321 |
5 | 3203133422432244430 |
6 | 43445145522525333 |
7 | 2516303226154614 |
oct | 276163626054471 |
9 | 51250660630483 |
10 | 13072242071865 |
11 | 418a9a7947619 |
12 | 15715a3506849 |
13 | 73a926774cc2 |
14 | 3329b270b17b |
15 | 17a08ba252b0 |
hex | be39e585939 |
13072242071865 has 8 divisors (see below), whose sum is σ = 20915587315008. Its totient is φ = 6971862438320.
The previous prime is 13072242071857. The next prime is 13072242071869. The reversal of 13072242071865 is 56817024227031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13072242071865 - 23 = 13072242071857 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13072242071869) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 435741402381 + ... + 435741402410.
It is an arithmetic number, because the mean of its divisors is an integer number (2614448414376).
Almost surely, 213072242071865 is an apocalyptic number.
13072242071865 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13072242071865 is a deficient number, since it is larger than the sum of its proper divisors (7843345243143).
13072242071865 is an equidigital number, since it uses as much as digits as its factorization.
13072242071865 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 871482804799.
The product of its (nonzero) digits is 1128960, while the sum is 48.
Adding to 13072242071865 its reverse (56817024227031), we get a palindrome (69889266298896).
The spelling of 13072242071865 in words is "thirteen trillion, seventy-two billion, two hundred forty-two million, seventy-one thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •