Base | Representation |
---|---|
bin | 10011111111010100110… |
… | …100000111101100010101 |
3 | 11212022200002001012020101 |
4 | 103333110310013230111 |
5 | 140001231220001323 |
6 | 2531015240134101 |
7 | 201146461564012 |
oct | 23772464075425 |
9 | 4768602035211 |
10 | 1373665000213 |
11 | 48a628099160 |
12 | 1a2285767331 |
13 | 9c6c792ca6c |
14 | 4a6b2c30709 |
15 | 25aeb186dad |
hex | 13fd4d07b15 |
1373665000213 has 4 divisors (see below), whose sum is σ = 1498543636608. Its totient is φ = 1248786363820.
The previous prime is 1373665000189. The next prime is 1373665000243. The reversal of 1373665000213 is 3120005663731.
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.
It is a cyclic number.
It is not a de Polignac number, because 1373665000213 - 217 = 1373664869141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1373665000243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62439318181 + ... + 62439318202.
It is an arithmetic number, because the mean of its divisors is an integer number (374635909152).
Almost surely, 21373665000213 is an apocalyptic number.
It is an amenable number.
1373665000213 is a deficient number, since it is larger than the sum of its proper divisors (124878636395).
1373665000213 is a wasteful number, since it uses less digits than its factorization.
1373665000213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124878636394.
The product of its (nonzero) digits is 68040, while the sum is 37.
The spelling of 1373665000213 in words is "one trillion, three hundred seventy-three billion, six hundred sixty-five million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •