Base | Representation |
---|---|
bin | 110110101000010111001111… |
… | …1011010001110111011011111 |
3 | 2100000102211200221022221112122 |
4 | 1231100232133122032323133 |
5 | 1000441102223102320412 |
6 | 4422003230513453155 |
7 | 203134421306354633 |
oct | 15520563732167337 |
9 | 2300384627287478 |
10 | 480536500432607 |
11 | 12a128426a2a513 |
12 | 45a8b2398711bb |
13 | 17819522565848 |
14 | 869413ad04dc3 |
15 | 3a84cccd0d572 |
hex | 1b50b9f68eedf |
480536500432607 has 4 divisors (see below), whose sum is σ = 487708687006296. Its totient is φ = 473364313858920.
The previous prime is 480536500432577. The next prime is 480536500432691. The reversal of 480536500432607 is 706234005635084.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 480536500432607 - 214 = 480536500416223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (480536500432007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3586093286744 + ... + 3586093286877.
It is an arithmetic number, because the mean of its divisors is an integer number (121927171751574).
Almost surely, 2480536500432607 is an apocalyptic number.
480536500432607 is a deficient number, since it is larger than the sum of its proper divisors (7172186573689).
480536500432607 is an equidigital number, since it uses as much as digits as its factorization.
480536500432607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7172186573688.
The product of its (nonzero) digits is 14515200, while the sum is 53.
The spelling of 480536500432607 in words is "four hundred eighty trillion, five hundred thirty-six billion, five hundred million, four hundred thirty-two thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •