Base | Representation |
---|---|
bin | 110011101000101010… |
… | …010000110100111011 |
3 | 12022002220210020210222 |
4 | 303220222100310323 |
5 | 1402021402010020 |
6 | 41245315530255 |
7 | 4001633505161 |
oct | 635052206473 |
9 | 168086706728 |
10 | 55443000635 |
11 | 21571145a90 |
12 | a8b38b998b |
13 | 52c7617469 |
14 | 297d58b231 |
15 | 1697655b25 |
hex | ce8a90d3b |
55443000635 has 32 divisors (see below), whose sum is σ = 79721694720. Its totient is φ = 36539078400.
The previous prime is 55443000527. The next prime is 55443000637. The reversal of 55443000635 is 53600034455.
55443000635 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-55443000635 is a prime.
It is a super-2 number, since 2×554430006352 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55443000595 and 55443000604.
It is not an unprimeable number, because it can be changed into a prime (55443000637) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1129346 + ... + 1177415.
It is an arithmetic number, because the mean of its divisors is an integer number (2491302960).
Almost surely, 255443000635 is an apocalyptic number.
55443000635 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
55443000635 is a deficient number, since it is larger than the sum of its proper divisors (24278694085).
55443000635 is a wasteful number, since it uses less digits than its factorization.
55443000635 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2306819.
The product of its (nonzero) digits is 108000, while the sum is 35.
The spelling of 55443000635 in words is "fifty-five billion, four hundred forty-three million, six hundred thirty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •