Base | Representation |
---|---|
bin | 1110000010110010000… |
… | …10000100100111011101 |
3 | 1201010111100102102122122 |
4 | 13001121002010213131 |
5 | 30401210143140243 |
6 | 1005400553352325 |
7 | 46601354526122 |
oct | 7013102044735 |
9 | 1633440372578 |
10 | 482530052573 |
11 | 1767046a9418 |
12 | 796264086a5 |
13 | 3666b99548a |
14 | 194d6d72749 |
15 | c84207c668 |
hex | 70590849dd |
482530052573 has 16 divisors (see below), whose sum is σ = 492124377600. Its totient is φ = 473052052800.
The previous prime is 482530052567. The next prime is 482530052617. The reversal of 482530052573 is 375250035284.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 482530052573 - 26 = 482530052509 is a prime.
It is a super-2 number, since 2×4825300525732 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (482530022573) 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 15 ways as a sum of consecutive naturals, for example, 4374068 + ... + 4483026.
It is an arithmetic number, because the mean of its divisors is an integer number (30757773600).
Almost surely, 2482530052573 is an apocalyptic number.
It is an amenable number.
482530052573 is a deficient number, since it is larger than the sum of its proper divisors (9594325027).
482530052573 is a wasteful number, since it uses less digits than its factorization.
482530052573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109492.
The product of its (nonzero) digits is 1008000, while the sum is 44.
Multiplying 482530052573 by its sum of digits (44), we get a palindrome (21231322313212).
The spelling of 482530052573 in words is "four hundred eighty-two billion, five hundred thirty million, fifty-two thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •