Base | Representation |
---|---|
bin | 101101001011110011010… |
… | …011000110110100111101 |
3 | 101222211200011002210101202 |
4 | 231023303103012310331 |
5 | 401333114323304101 |
6 | 10334234532145245 |
7 | 440221663506350 |
oct | 55136323066475 |
9 | 11884604083352 |
10 | 3105048259901 |
11 | a979308811a5 |
12 | 421942468225 |
13 | 196a60197583 |
14 | aa3dc5bc297 |
15 | 55b81c6936b |
hex | 2d2f34c6d3d |
3105048259901 has 4 divisors (see below), whose sum is σ = 3548626582752. Its totient is φ = 2661469937052.
The previous prime is 3105048259889. The next prime is 3105048259921. The reversal of 3105048259901 is 1099528405013.
3105048259901 is digitally balanced in base 3, 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 3105048259901 - 230 = 3103974518077 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 (3105048259921) 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, 221789161415 + ... + 221789161428.
It is an arithmetic number, because the mean of its divisors is an integer number (887156645688).
Almost surely, 23105048259901 is an apocalyptic number.
It is an amenable number.
3105048259901 is a deficient number, since it is larger than the sum of its proper divisors (443578322851).
3105048259901 is an equidigital number, since it uses as much as digits as its factorization.
3105048259901 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 443578322850.
The product of its (nonzero) digits is 388800, while the sum is 47.
The spelling of 3105048259901 in words is "three trillion, one hundred five billion, forty-eight million, two hundred fifty-nine thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •