Base | Representation |
---|---|
bin | 10011011100100000000111… |
… | …10001100001110101011101 |
3 | 12121101212222201121221100011 |
4 | 21232100003301201311131 |
5 | 21101043012433324034 |
6 | 230540004303203221 |
7 | 12002235303321400 |
oct | 1156200361416535 |
9 | 177355881557304 |
10 | 42760757714269 |
11 | 1269680aa60551 |
12 | 49673a32a6511 |
13 | 1ab24259c1a8a |
14 | a7b8bb601d37 |
15 | 4e248acc7864 |
hex | 26e403c61d5d |
42760757714269 has 24 divisors (see below), whose sum is σ = 50040369540000. Its totient is φ = 36432890172000.
The previous prime is 42760757714267. The next prime is 42760757714333. The reversal of 42760757714269 is 96241775706724.
It is not a de Polignac number, because 42760757714269 - 21 = 42760757714267 is a prime.
It is a super-2 number, since 2×427607577142692 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42760757714261) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2653467 + ... + 9620935.
It is an arithmetic number, because the mean of its divisors is an integer number (2085015397500).
Almost surely, 242760757714269 is an apocalyptic number.
42760757714269 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
It is an amenable number.
42760757714269 is a deficient number, since it is larger than the sum of its proper divisors (7279611825731).
42760757714269 is a wasteful number, since it uses less digits than its factorization.
42760757714269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6968233 (or 6968226 counting only the distinct ones).
The product of its (nonzero) digits is 248935680, while the sum is 67.
The spelling of 42760757714269 in words is "forty-two trillion, seven hundred sixty billion, seven hundred fifty-seven million, seven hundred fourteen thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •