Base | Representation |
---|---|
bin | 10011111100011101000… |
… | …000110110101000001001 |
3 | 11212000201011120112112211 |
4 | 103330131000312220021 |
5 | 134423422310033231 |
6 | 2525345242305121 |
7 | 201010166042101 |
oct | 23743500665011 |
9 | 4760634515484 |
10 | 1370581330441 |
11 | 489295480444 |
12 | 1a1764ab81a1 |
13 | 9c325b019ab |
14 | 4a49d488201 |
15 | 259ba5b6eb1 |
hex | 13f1d036a09 |
1370581330441 has 8 divisors (see below), whose sum is σ = 1403435905920. Its totient is φ = 1337880641328.
The previous prime is 1370581330427. The next prime is 1370581330453. The reversal of 1370581330441 is 1440331850731.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1370581330441 - 25 = 1370581330409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1370581330394 and 1370581330403.
It is not an unprimeable number, because it can be changed into a prime (1370581330241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38453566 + ... + 38489191.
It is an arithmetic number, because the mean of its divisors is an integer number (175429488240).
Almost surely, 21370581330441 is an apocalyptic number.
It is an amenable number.
1370581330441 is a deficient number, since it is larger than the sum of its proper divisors (32854575479).
1370581330441 is an equidigital number, since it uses as much as digits as its factorization.
1370581330441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76943183.
The product of its (nonzero) digits is 120960, while the sum is 40.
The spelling of 1370581330441 in words is "one trillion, three hundred seventy billion, five hundred eighty-one million, three hundred thirty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •