Base | Representation |
---|---|
bin | 10000000001000111011… |
… | …10110111111111110001 |
3 | 1221121120012121012220211 |
4 | 20000203232313333301 |
5 | 33004111424220213 |
6 | 1100455120104121 |
7 | 54522213621154 |
oct | 10004356677761 |
9 | 1847505535824 |
10 | 550355304433 |
11 | 1a244a248a80 |
12 | 8a7b4a65041 |
13 | 3cb8a6b01bc |
14 | 1c8ccc01c9b |
15 | e4b17ad53d |
hex | 8023bb7ff1 |
550355304433 has 4 divisors (see below), whose sum is σ = 600387604848. Its totient is φ = 500323004020.
The previous prime is 550355304383. The next prime is 550355304437. The reversal of 550355304433 is 334403553055.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-550355304433 is a prime.
It is a super-2 number, since 2×5503553044332 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (550355304437) 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, 25016150191 + ... + 25016150212.
It is an arithmetic number, because the mean of its divisors is an integer number (150096901212).
Almost surely, 2550355304433 is an apocalyptic number.
It is an amenable number.
550355304433 is a deficient number, since it is larger than the sum of its proper divisors (50032300415).
550355304433 is a wasteful number, since it uses less digits than its factorization.
550355304433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50032300414.
The product of its (nonzero) digits is 810000, while the sum is 40.
Adding to 550355304433 its reverse (334403553055), we get a palindrome (884758857488).
The spelling of 550355304433 in words is "five hundred fifty billion, three hundred fifty-five million, three hundred four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •