Base | Representation |
---|---|
bin | 1101010001110… |
… | …1110001100001 |
3 | 10212210200012122 |
4 | 3110131301201 |
5 | 103224241411 |
6 | 5305434025 |
7 | 1244261261 |
oct | 324356141 |
9 | 125720178 |
10 | 55696481 |
11 | 29491655 |
12 | 1679b915 |
13 | b7011c9 |
14 | 757b7a1 |
15 | 4d529db |
hex | 351dc61 |
55696481 has 8 divisors (see below), whose sum is σ = 58069440. Its totient is φ = 53372592.
The previous prime is 55696469. The next prime is 55696483. The reversal of 55696481 is 18469655.
55696481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55696481 is a prime.
It is a super-2 number, since 2×556964812 = 6204195991566722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55696483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9941 + ... + 14498.
It is an arithmetic number, because the mean of its divisors is an integer number (7258680).
Almost surely, 255696481 is an apocalyptic number.
It is an amenable number.
55696481 is a deficient number, since it is larger than the sum of its proper divisors (2372959).
55696481 is a wasteful number, since it uses less digits than its factorization.
55696481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24535.
The product of its digits is 259200, while the sum is 44.
The square root of 55696481 is about 7463.0075036811. The cubic root of 55696481 is about 381.8937804870.
The spelling of 55696481 in words is "fifty-five million, six hundred ninety-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •