Base | Representation |
---|---|
bin | 1110000010100100111… |
… | …10110001000100011001 |
3 | 1201010012200120222221122 |
4 | 13001102132301010121 |
5 | 30400444023243134 |
6 | 1005342025415025 |
7 | 46565551324241 |
oct | 7012236610431 |
9 | 1633180528848 |
10 | 482420134169 |
11 | 176658653066 |
12 | 795b563a475 |
13 | 36651c8b2bc |
14 | 194c651cb21 |
15 | c8375b902e |
hex | 70527b1119 |
482420134169 has 4 divisors (see below), whose sum is σ = 487103824896. Its totient is φ = 477736443444.
The previous prime is 482420134153. The next prime is 482420134193. The reversal of 482420134169 is 961431024284.
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 482420134169 - 24 = 482420134153 is a prime.
It is a super-2 number, since 2×4824201341692 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (482420134069) 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 in 3 ways as a sum of consecutive naturals, for example, 2341845209 + ... + 2341845414.
It is an arithmetic number, because the mean of its divisors is an integer number (121775956224).
Almost surely, 2482420134169 is an apocalyptic number.
It is an amenable number.
482420134169 is a deficient number, since it is larger than the sum of its proper divisors (4683690727).
482420134169 is a wasteful number, since it uses less digits than its factorization.
482420134169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4683690726.
The product of its (nonzero) digits is 331776, while the sum is 44.
The spelling of 482420134169 in words is "four hundred eighty-two billion, four hundred twenty million, one hundred thirty-four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •