Base | Representation |
---|---|
bin | 10011111011111011110… |
… | …111111110101100010011 |
3 | 11211222021102102010001202 |
4 | 103323323313332230103 |
5 | 134421302442343201 |
6 | 2525214142021415 |
7 | 200660335245362 |
oct | 23737367765423 |
9 | 4758242363052 |
10 | 1370025356051 |
11 | 48902a662680 |
12 | 1a162a87786b |
13 | 9c26787c071 |
14 | 4a4496c17d9 |
15 | 25986893c6b |
hex | 13efbdfeb13 |
1370025356051 has 8 divisors (see below), whose sum is σ = 1497190588608. Its totient is φ = 1243296369000.
The previous prime is 1370025356041. The next prime is 1370025356107. The reversal of 1370025356051 is 1506535200731.
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 1370025356051 - 26 = 1370025355987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1370025355996 and 1370025356014.
It is not an unprimeable number, because it can be changed into a prime (1370025356041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 109054805 + ... + 109067366.
It is an arithmetic number, because the mean of its divisors is an integer number (187148823576).
Almost surely, 21370025356051 is an apocalyptic number.
1370025356051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1370025356051 is a deficient number, since it is larger than the sum of its proper divisors (127165232557).
1370025356051 is a wasteful number, since it uses less digits than its factorization.
1370025356051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218122753.
The product of its (nonzero) digits is 94500, while the sum is 38.
The spelling of 1370025356051 in words is "one trillion, three hundred seventy billion, twenty-five million, three hundred fifty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •