Base | Representation |
---|---|
bin | 101100010100100010001… |
… | …010100011100011010111 |
3 | 101210011111102022002221010 |
4 | 230110202022203203113 |
5 | 344400100440132041 |
6 | 10251102204223303 |
7 | 433021260251235 |
oct | 54244212434327 |
9 | 11704442262833 |
10 | 3045705005271 |
11 | a7474908a705 |
12 | 41234053ab33 |
13 | 191293813716 |
14 | a75ad043955 |
15 | 5435bee2a16 |
hex | 2c5222a38d7 |
3045705005271 has 4 divisors (see below), whose sum is σ = 4060940007032. Its totient is φ = 2030470003512.
The previous prime is 3045705005263. The next prime is 3045705005279. The reversal of 3045705005271 is 1725005075403.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (3045705005263) and next prime (3045705005279).
It is not a de Polignac number, because 3045705005271 - 23 = 3045705005263 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 (3045705005279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 507617500876 + ... + 507617500881.
It is an arithmetic number, because the mean of its divisors is an integer number (1015235001758).
Almost surely, 23045705005271 is an apocalyptic number.
3045705005271 is a deficient number, since it is larger than the sum of its proper divisors (1015235001761).
3045705005271 is a wasteful number, since it uses less digits than its factorization.
3045705005271 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015235001760.
The product of its (nonzero) digits is 147000, while the sum is 39.
The spelling of 3045705005271 in words is "three trillion, forty-five billion, seven hundred five million, five thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •