Base | Representation |
---|---|
bin | 111110100010110011010… |
… | …010100111101111111111 |
3 | 120012212211021210021010222 |
4 | 332202303102213233333 |
5 | 1030404223134032241 |
6 | 13050243530451555 |
7 | 622342556155346 |
oct | 76426322475777 |
9 | 16185737707128 |
10 | 4297975299071 |
11 | 1407841010113 |
12 | 594b87293bbb |
13 | 2523b3311c4c |
14 | 10c0475d6b5d |
15 | 76c00a27a4b |
hex | 3e8b34a7bff |
4297975299071 has 8 divisors (see below), whose sum is σ = 4408620118224. Its totient is φ = 4187607439680.
The previous prime is 4297975299067. The next prime is 4297975299083. The reversal of 4297975299071 is 1709925797924.
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 4297975299071 - 22 = 4297975299067 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4297975298986 and 4297975299004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4297975299271) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69208505 + ... + 69270578.
It is an arithmetic number, because the mean of its divisors is an integer number (551077514778).
Almost surely, 24297975299071 is an apocalyptic number.
4297975299071 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
4297975299071 is a deficient number, since it is larger than the sum of its proper divisors (110644819153).
4297975299071 is a wasteful number, since it uses less digits than its factorization.
4297975299071 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138479881.
The product of its (nonzero) digits is 180033840, while the sum is 71.
The spelling of 4297975299071 in words is "four trillion, two hundred ninety-seven billion, nine hundred seventy-five million, two hundred ninety-nine thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •