Base | Representation |
---|---|
bin | 111011101000001100011… |
… | …001000011011000111111 |
3 | 112111201122020220112012001 |
4 | 323220030121003120333 |
5 | 1014113344303210323 |
6 | 12414225312123131 |
7 | 602020341136342 |
oct | 73501431033077 |
9 | 15451566815161 |
10 | 4097606694463 |
11 | 133a870177907 |
12 | 5621882364a7 |
13 | 239530824649 |
14 | 10247a5a4459 |
15 | 718c50423ad |
hex | 3ba0c64363f |
4097606694463 has 4 divisors (see below), whose sum is σ = 4192899873448. Its totient is φ = 4002313515480.
The previous prime is 4097606694431. The next prime is 4097606694547. The reversal of 4097606694463 is 3644966067904.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4097606694463 - 25 = 4097606694431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4097606694395 and 4097606694404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4097606694163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47646589428 + ... + 47646589513.
It is an arithmetic number, because the mean of its divisors is an integer number (1048224968362).
Almost surely, 24097606694463 is an apocalyptic number.
4097606694463 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
4097606694463 is a deficient number, since it is larger than the sum of its proper divisors (95293178985).
4097606694463 is an equidigital number, since it uses as much as digits as its factorization.
4097606694463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95293178984.
The product of its (nonzero) digits is 141087744, while the sum is 64.
The spelling of 4097606694463 in words is "four trillion, ninety-seven billion, six hundred six million, six hundred ninety-four thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •