Base | Representation |
---|---|
bin | 1010001001101100… |
… | …10010101110000001 |
3 | 112001211020020200202 |
4 | 11010312102232001 |
5 | 42130203103213 |
6 | 2300445254545 |
7 | 252025443602 |
oct | 50466225601 |
9 | 15054206622 |
10 | 5450050433 |
11 | 2347458613 |
12 | 1081264455 |
13 | 68b175519 |
14 | 399b73da9 |
15 | 21d704b58 |
hex | 144d92b81 |
5450050433 has 4 divisors (see below), whose sum is σ = 5502963648. Its totient is φ = 5397137220.
The previous prime is 5450050339. The next prime is 5450050447. The reversal of 5450050433 is 3340500545.
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 not a de Polignac number, because 5450050433 - 226 = 5382941569 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5450050396 and 5450050405.
It is not an unprimeable number, because it can be changed into a prime (5450050733) 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, 26456453 + ... + 26456658.
It is an arithmetic number, because the mean of its divisors is an integer number (1375740912).
Almost surely, 25450050433 is an apocalyptic number.
It is an amenable number.
5450050433 is a deficient number, since it is larger than the sum of its proper divisors (52913215).
5450050433 is a wasteful number, since it uses less digits than its factorization.
5450050433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52913214.
The product of its (nonzero) digits is 18000, while the sum is 29.
The square root of 5450050433 is about 73824.4568757536. The cubic root of 5450050433 is about 1759.8142918079.
Adding to 5450050433 its reverse (3340500545), we get a palindrome (8790550978).
The spelling of 5450050433 in words is "five billion, four hundred fifty million, fifty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •