Base | Representation |
---|---|
bin | 101101100111000010101… |
… | …001000001001111110101 |
3 | 102002122011112012002000121 |
4 | 231213002221001033311 |
5 | 402323014423113301 |
6 | 10355513115411541 |
7 | 442305536205310 |
oct | 55470251011765 |
9 | 12078145162017 |
10 | 3134296691701 |
11 | aa927a85398a |
12 | 427545753bb1 |
13 | 199741936156 |
14 | ab9b4ca7977 |
15 | 567e48d63a1 |
hex | 2d9c2a413f5 |
3134296691701 has 4 divisors (see below), whose sum is σ = 3582053361952. Its totient is φ = 2686540021452.
The previous prime is 3134296691699. The next prime is 3134296691731. The reversal of 3134296691701 is 1071966924313.
3134296691701 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 not a de Polignac number, because 3134296691701 - 21 = 3134296691699 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3134296691731) 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, 223878335115 + ... + 223878335128.
It is an arithmetic number, because the mean of its divisors is an integer number (895513340488).
Almost surely, 23134296691701 is an apocalyptic number.
It is an amenable number.
3134296691701 is a deficient number, since it is larger than the sum of its proper divisors (447756670251).
3134296691701 is an equidigital number, since it uses as much as digits as its factorization.
3134296691701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447756670250.
The product of its (nonzero) digits is 1469664, while the sum is 52.
The spelling of 3134296691701 in words is "three trillion, one hundred thirty-four billion, two hundred ninety-six million, six hundred ninety-one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •