Base | Representation |
---|---|
bin | 1110000011011011001… |
… | …00111000111011100101 |
3 | 1201011101100222120001121 |
4 | 13001231210320323211 |
5 | 30402411412132234 |
6 | 1005455105053541 |
7 | 46613041301233 |
oct | 7015544707345 |
9 | 1634340876047 |
10 | 482874724069 |
11 | 1768712141a1 |
12 | 797019272b1 |
13 | 366c52041ca |
14 | 1952aa53953 |
15 | c8624624b4 |
hex | 706d938ee5 |
482874724069 has 2 divisors, whose sum is σ = 482874724070. Its totient is φ = 482874724068.
The previous prime is 482874724067. The next prime is 482874724091. The reversal of 482874724069 is 960427478284.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 459880641025 + 22994083044 = 678145^2 + 151638^2 .
It is a cyclic number.
It is not a de Polignac number, because 482874724069 - 21 = 482874724067 is a prime.
It is a super-2 number, since 2×4828747240692 (a number of 24 digits) contains 22 as substring.
Together with 482874724067, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 482874723998 and 482874724016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (482874724067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 241437362034 + 241437362035.
It is an arithmetic number, because the mean of its divisors is an integer number (241437362035).
Almost surely, 2482874724069 is an apocalyptic number.
It is an amenable number.
482874724069 is a deficient number, since it is larger than the sum of its proper divisors (1).
482874724069 is an equidigital number, since it uses as much as digits as its factorization.
482874724069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43352064, while the sum is 61.
The spelling of 482874724069 in words is "four hundred eighty-two billion, eight hundred seventy-four million, seven hundred twenty-four thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •