Base | Representation |
---|---|
bin | 101000110110011… |
… | …1010110010101001 |
3 | 10112112021021120111 |
4 | 1101230322302221 |
5 | 10301401322031 |
6 | 344003254321 |
7 | 45653003221 |
oct | 12154726251 |
9 | 3475237514 |
10 | 1370729641 |
11 | 643817516 |
12 | 32307a3a1 |
13 | 18aca0938 |
14 | d0093081 |
15 | 805121b1 |
hex | 51b3aca9 |
1370729641 has 4 divisors (see below), whose sum is σ = 1372636800. Its totient is φ = 1368822484.
The previous prime is 1370729629. The next prime is 1370729677. The reversal of 1370729641 is 1469270731.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 1469270731 = 83 ⋅17702057.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1370729641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1370729594 and 1370729603.
It is not an unprimeable number, because it can be changed into a prime (1370729441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 952501 + ... + 953938.
It is an arithmetic number, because the mean of its divisors is an integer number (343159200).
Almost surely, 21370729641 is an apocalyptic number.
It is an amenable number.
1370729641 is a deficient number, since it is larger than the sum of its proper divisors (1907159).
1370729641 is an equidigital number, since it uses as much as digits as its factorization.
1370729641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1907158.
The product of its (nonzero) digits is 63504, while the sum is 40.
The square root of 1370729641 is about 37023.3661489606. The cubic root of 1370729641 is about 1110.8376765264.
The spelling of 1370729641 in words is "one billion, three hundred seventy million, seven hundred twenty-nine thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •