Base | Representation |
---|---|
bin | 111110100101100101010001… |
… | …0010001001000001000010111 |
3 | 2200012020111012020122112112102 |
4 | 1331023022202101020020113 |
5 | 1034124232141324343211 |
6 | 5230510443211312315 |
7 | 223646656103242115 |
oct | 17513124221101027 |
9 | 2605214166575472 |
10 | 550523040465431 |
11 | 14a460568267020 |
12 | 518b307844b69b |
13 | 1a82513b7c1217 |
14 | 99d3658caaab5 |
15 | 439a57ace5a3b |
hex | 1f4b2a2448217 |
550523040465431 has 4 divisors (see below), whose sum is σ = 600570589598664. Its totient is φ = 500475491332200.
The previous prime is 550523040465427. The next prime is 550523040465451. The reversal of 550523040465431 is 134564040325055.
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 550523040465431 - 22 = 550523040465427 is a prime.
It is a super-2 number, since 2×5505230404654312 (a number of 30 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 (550523040465451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25023774566600 + ... + 25023774566621.
It is an arithmetic number, because the mean of its divisors is an integer number (150142647399666).
Almost surely, 2550523040465431 is an apocalyptic number.
550523040465431 is a deficient number, since it is larger than the sum of its proper divisors (50047549133233).
550523040465431 is a wasteful number, since it uses less digits than its factorization.
550523040465431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50047549133232.
The product of its (nonzero) digits is 4320000, while the sum is 47.
The spelling of 550523040465431 in words is "five hundred fifty trillion, five hundred twenty-three billion, forty million, four hundred sixty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •