Base | Representation |
---|---|
bin | 110011101000000101… |
… | …111001001001000001 |
3 | 12022002020211212100101 |
4 | 303220011321021001 |
5 | 1402011431411213 |
6 | 41244335322401 |
7 | 4001456455522 |
oct | 635005711101 |
9 | 168066755311 |
10 | 55433466433 |
11 | 21566823884 |
12 | a8b0680401 |
13 | 52c5659917 |
14 | 297c1c8849 |
15 | 16968c0bdd |
hex | ce8179241 |
55433466433 has 8 divisors (see below), whose sum is σ = 56484644328. Its totient is φ = 54382483584.
The previous prime is 55433466421. The next prime is 55433466437. The reversal of 55433466433 is 33466433455.
It can be written as a sum of positive squares in 4 ways, for example, as 5948574129 + 49484892304 = 77127^2 + 222452^2 .
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 55433466433 - 25 = 55433466401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55433466437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 608085 + ... + 693277.
It is an arithmetic number, because the mean of its divisors is an integer number (7060580541).
Almost surely, 255433466433 is an apocalyptic number.
55433466433 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
55433466433 is a deficient number, since it is larger than the sum of its proper divisors (1051177895).
55433466433 is a wasteful number, since it uses less digits than its factorization.
55433466433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97523.
The product of its digits is 4665600, while the sum is 46.
Adding to 55433466433 its reverse (33466433455), we get a palindrome (88899899888).
The spelling of 55433466433 in words is "fifty-five billion, four hundred thirty-three million, four hundred sixty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •