Base | Representation |
---|---|
bin | 110001011010111101000… |
… | …101010010011011010001 |
3 | 110000200011202202222022012 |
4 | 301122331011102123101 |
5 | 421120402242200412 |
6 | 11120105140152305 |
7 | 500236625315120 |
oct | 61327505223321 |
9 | 13020152688265 |
10 | 3396196443857 |
11 | 109a356399048 |
12 | 46a257398695 |
13 | 1b834c15a2b9 |
14 | ba53bc7dab7 |
15 | 5d52226cc22 |
hex | 316bd1526d1 |
3396196443857 has 4 divisors (see below), whose sum is σ = 3881367364416. Its totient is φ = 2911025523300.
The previous prime is 3396196443803. The next prime is 3396196443917. The reversal of 3396196443857 is 7583446916933.
3396196443857 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3396196443857 - 212 = 3396196439761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3396196433857) 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, 242585460269 + ... + 242585460282.
It is an arithmetic number, because the mean of its divisors is an integer number (970341841104).
Almost surely, 23396196443857 is an apocalyptic number.
It is an amenable number.
3396196443857 is a deficient number, since it is larger than the sum of its proper divisors (485170920559).
3396196443857 is an equidigital number, since it uses as much as digits as its factorization.
3396196443857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 485170920558.
The product of its digits is 352719360, while the sum is 68.
The spelling of 3396196443857 in words is "three trillion, three hundred ninety-six billion, one hundred ninety-six million, four hundred forty-three thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •