Base | Representation |
---|---|
bin | 10000000001010001000… |
… | …00111010111011110011 |
3 | 1221121202210120020011212 |
4 | 20000220200322323303 |
5 | 33004242444020111 |
6 | 1100511103430335 |
7 | 54524206554263 |
oct | 10005040727363 |
9 | 1847683506155 |
10 | 550435532531 |
11 | 1a2490565595 |
12 | 8a8178b53ab |
13 | 3cba11c0351 |
14 | 1c8d97277a3 |
15 | e4b885998b |
hex | 802883aef3 |
550435532531 has 8 divisors (see below), whose sum is σ = 563872417584. Its totient is φ = 536999201280.
The previous prime is 550435532519. The next prime is 550435532561. The reversal of 550435532531 is 135235534055.
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 550435532531 - 26 = 550435532467 is a prime.
It is a super-2 number, since 2×5504355325312 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550435532501) 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, 2462915 + ... + 2677091.
It is an arithmetic number, because the mean of its divisors is an integer number (70484052198).
Almost surely, 2550435532531 is an apocalyptic number.
550435532531 is a deficient number, since it is larger than the sum of its proper divisors (13436885053).
550435532531 is a wasteful number, since it uses less digits than its factorization.
550435532531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276901.
The product of its (nonzero) digits is 675000, while the sum is 41.
The spelling of 550435532531 in words is "five hundred fifty billion, four hundred thirty-five million, five hundred thirty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •