Base | Representation |
---|---|
bin | 10011111011111011001… |
… | …011100100010110101101 |
3 | 11211222020121111121221122 |
4 | 103323323023210112231 |
5 | 134421242002320322 |
6 | 2525213044310325 |
7 | 200660134266146 |
oct | 23737313442655 |
9 | 4758217447848 |
10 | 1370013713837 |
11 | 48902403070a |
12 | 1a16269a23a5 |
13 | 9c265333b92 |
14 | 4a447d30acd |
15 | 25985844442 |
hex | 13efb2e45ad |
1370013713837 has 16 divisors (see below), whose sum is σ = 1382949609792. Its totient is φ = 1357122729600.
The previous prime is 1370013713773. The next prime is 1370013713863. The reversal of 1370013713837 is 7383173100731.
It is a cyclic number.
It is not a de Polignac number, because 1370013713837 - 26 = 1370013713773 is a prime.
It is a super-2 number, since 2×13700137138372 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1370013713867) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 338189462 + ... + 338193512.
It is an arithmetic number, because the mean of its divisors is an integer number (86434350612).
Almost surely, 21370013713837 is an apocalyptic number.
It is an amenable number.
1370013713837 is a deficient number, since it is larger than the sum of its proper divisors (12935895955).
1370013713837 is a wasteful number, since it uses less digits than its factorization.
1370013713837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8828.
The product of its (nonzero) digits is 222264, while the sum is 44.
The spelling of 1370013713837 in words is "one trillion, three hundred seventy billion, thirteen million, seven hundred thirteen thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •