Base | Representation |
---|---|
bin | 1110000001111000010… |
… | …11011000101000001101 |
3 | 1201002020121111201001002 |
4 | 13000330023120220031 |
5 | 30344212231021243 |
6 | 1005240541430045 |
7 | 46553356002521 |
oct | 7007413305015 |
9 | 1632217451032 |
10 | 482045954573 |
11 | 176486413427 |
12 | 7951026b325 |
13 | 365c25ba461 |
14 | 1948c959d81 |
15 | c814805eb8 |
hex | 703c2d8a0d |
482045954573 has 8 divisors (see below), whose sum is σ = 485879582208. Its totient is φ = 478224364464.
The previous prime is 482045954557. The next prime is 482045954581. The reversal of 482045954573 is 375459540284.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 482045954573 - 24 = 482045954557 is a prime.
It is a super-3 number, since 3×4820459545733 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (482045951573) 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 7 ways as a sum of consecutive naturals, for example, 2928965 + ... + 3089162.
It is an arithmetic number, because the mean of its divisors is an integer number (60734947776).
Almost surely, 2482045954573 is an apocalyptic number.
It is an amenable number.
482045954573 is a deficient number, since it is larger than the sum of its proper divisors (3833627635).
482045954573 is a wasteful number, since it uses less digits than its factorization.
482045954573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6018763.
The product of its (nonzero) digits is 24192000, while the sum is 56.
The spelling of 482045954573 in words is "four hundred eighty-two billion, forty-five million, nine hundred fifty-four thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •