Base | Representation |
---|---|
bin | 10010010011011110010… |
… | …011100000011100001101 |
3 | 11110020202102201001000020 |
4 | 102103132103200130031 |
5 | 131102044141342442 |
6 | 2401504123252353 |
7 | 156606642326505 |
oct | 22233623403415 |
9 | 4406672631006 |
10 | 1257860105997 |
11 | 445501268110 |
12 | 18394697a0b9 |
13 | 918008c9811 |
14 | 44c48b08a05 |
15 | 22abe6459ec |
hex | 124de4e070d |
1257860105997 has 64 divisors (see below), whose sum is σ = 1993872651264. Its totient is φ = 696603939840.
The previous prime is 1257860105951. The next prime is 1257860106037. The reversal of 1257860105997 is 7995010687521.
It is not a de Polignac number, because 1257860105997 - 27 = 1257860105869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1257860105997.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1257860105197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9628638 + ... + 9758400.
It is an arithmetic number, because the mean of its divisors is an integer number (31154260176).
Almost surely, 21257860105997 is an apocalyptic number.
1257860105997 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
1257860105997 is a deficient number, since it is larger than the sum of its proper divisors (736012545267).
1257860105997 is a wasteful number, since it uses less digits than its factorization.
1257860105997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130298.
The product of its (nonzero) digits is 9525600, while the sum is 60.
The spelling of 1257860105997 in words is "one trillion, two hundred fifty-seven billion, eight hundred sixty million, one hundred five thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •