Base | Representation |
---|---|
bin | 111110010010010000110… |
… | …101111010101100010001 |
3 | 120011011222201022120211121 |
4 | 332102100311322230101 |
5 | 1030111341133324303 |
6 | 13034145455042241 |
7 | 621143531201062 |
oct | 76222065725421 |
9 | 16134881276747 |
10 | 4280217479953 |
11 | 1400259200848 |
12 | 591650210381 |
13 | 25081331707c |
14 | 10b24100c569 |
15 | 76511a5b9bd |
hex | 3e490d7ab11 |
4280217479953 has 2 divisors, whose sum is σ = 4280217479954. Its totient is φ = 4280217479952.
The previous prime is 4280217479939. The next prime is 4280217480001. The reversal of 4280217479953 is 3599747120824.
4280217479953 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2722443900289 + 1557773579664 = 1649983^2 + 1248108^2 .
It is a cyclic number.
It is not a de Polignac number, because 4280217479953 - 29 = 4280217479441 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4280217479891 and 4280217479900.
It is not a weakly prime, because it can be changed into another prime (4280217419953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2140108739976 + 2140108739977.
It is an arithmetic number, because the mean of its divisors is an integer number (2140108739977).
Almost surely, 24280217479953 is an apocalyptic number.
It is an amenable number.
4280217479953 is a deficient number, since it is larger than the sum of its proper divisors (1).
4280217479953 is an equidigital number, since it uses as much as digits as its factorization.
4280217479953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30481920, while the sum is 61.
The spelling of 4280217479953 in words is "four trillion, two hundred eighty billion, two hundred seventeen million, four hundred seventy-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •