Base | Representation |
---|---|
bin | 11011110101110111000… |
… | …010110010011100101001 |
3 | 20202220110012211201221211 |
4 | 123311313002302130221 |
5 | 222321322430310340 |
6 | 4022534411433121 |
7 | 255141210556024 |
oct | 33656702623451 |
9 | 6686405751854 |
10 | 1913257666345 |
11 | 67845408a733 |
12 | 26a9761557a1 |
13 | 10b55b62161c |
14 | 688604ac1bb |
15 | 34b7cb405ea |
hex | 1bd770b2729 |
1913257666345 has 8 divisors (see below), whose sum is σ = 2299944192840. Its totient is φ = 1527916137600.
The previous prime is 1913257666273. The next prime is 1913257666351. The reversal of 1913257666345 is 5436667523191.
It can be written as a sum of positive squares in 4 ways, for example, as 2272142889 + 1910985523456 = 47667^2 + 1382384^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1913257666345 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1913257666345.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 336246306 + ... + 336251995.
It is an arithmetic number, because the mean of its divisors is an integer number (287493024105).
Almost surely, 21913257666345 is an apocalyptic number.
It is an amenable number.
1913257666345 is a deficient number, since it is larger than the sum of its proper divisors (386686526495).
1913257666345 is an equidigital number, since it uses as much as digits as its factorization.
1913257666345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 672498875.
The product of its digits is 24494400, while the sum is 58.
The spelling of 1913257666345 in words is "one trillion, nine hundred thirteen billion, two hundred fifty-seven million, six hundred sixty-six thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •