Base | Representation |
---|---|
bin | 110010101100110101110… |
… | …011011000000001110011 |
3 | 110100002010101121011222111 |
4 | 302230311303120001303 |
5 | 424040440002343032 |
6 | 11224325543350151 |
7 | 506501525012131 |
oct | 62546563300163 |
9 | 13302111534874 |
10 | 3484121137267 |
11 | 1123675607621 |
12 | 4832b5152357 |
13 | 1c37220291c4 |
14 | c08bd2bc751 |
15 | 6096b30dc47 |
hex | 32b35cd8073 |
3484121137267 has 8 divisors (see below), whose sum is σ = 3520079415776. Its totient is φ = 3448163665152.
The previous prime is 3484121137223. The next prime is 3484121137279. The reversal of 3484121137267 is 7627311214843.
3484121137267 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3484121137267 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3484121137267.
It is not an unprimeable number, because it can be changed into a prime (3484121137867) 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, 12762733 + ... + 13032865.
It is an arithmetic number, because the mean of its divisors is an integer number (440009926972).
Almost surely, 23484121137267 is an apocalyptic number.
3484121137267 is a deficient number, since it is larger than the sum of its proper divisors (35958278509).
3484121137267 is a wasteful number, since it uses less digits than its factorization.
3484121137267 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 403197.
The product of its digits is 1354752, while the sum is 49.
The spelling of 3484121137267 in words is "three trillion, four hundred eighty-four billion, one hundred twenty-one million, one hundred thirty-seven thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •