Base | Representation |
---|---|
bin | 110010100000011000100… |
… | …001110010000101011101 |
3 | 110021210121012012021202121 |
4 | 302200120201302011131 |
5 | 423331041220144003 |
6 | 11214234400222541 |
7 | 505516204311046 |
oct | 62403041620535 |
9 | 13253535167677 |
10 | 3470745084253 |
11 | 1118a31132a57 |
12 | 4807a160aa51 |
13 | 1c239ca7ba35 |
14 | bddb0a238cd |
15 | 60436d78cbd |
hex | 3281887215d |
3470745084253 has 2 divisors, whose sum is σ = 3470745084254. Its totient is φ = 3470745084252.
The previous prime is 3470745084193. The next prime is 3470745084269. The reversal of 3470745084253 is 3524805470743.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3437397576484 + 33347507769 = 1854022^2 + 182613^2 .
It is a cyclic number.
It is not a de Polignac number, because 3470745084253 - 225 = 3470711529821 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3470745084253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3470745084353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1735372542126 + 1735372542127.
It is an arithmetic number, because the mean of its divisors is an integer number (1735372542127).
Almost surely, 23470745084253 is an apocalyptic number.
It is an amenable number.
3470745084253 is a deficient number, since it is larger than the sum of its proper divisors (1).
3470745084253 is an equidigital number, since it uses as much as digits as its factorization.
3470745084253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11289600, while the sum is 52.
The spelling of 3470745084253 in words is "three trillion, four hundred seventy billion, seven hundred forty-five million, eighty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •