Base | Representation |
---|---|
bin | 1101010001101… |
… | …0100000011001 |
3 | 10212202222211221 |
4 | 3110122200121 |
5 | 103223324342 |
6 | 5305252041 |
7 | 1244204251 |
oct | 324324031 |
9 | 125688757 |
10 | 55683097 |
11 | 29482598 |
12 | 16794021 |
13 | b6c80a2 |
14 | 7576961 |
15 | 4d4da67 |
hex | 351a819 |
55683097 has 4 divisors (see below), whose sum is σ = 56514256. Its totient is φ = 54851940.
The previous prime is 55683083. The next prime is 55683107. The reversal of 55683097 is 79038655.
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, and also an emirpimes, since its reverse is a distinct semiprime: 79038655 = 5 ⋅15807731.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55683097 is a prime.
It is a super-2 number, since 2×556830972 = 6201214583022818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55683497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 415479 + ... + 415612.
It is an arithmetic number, because the mean of its divisors is an integer number (14128564).
Almost surely, 255683097 is an apocalyptic number.
It is an amenable number.
55683097 is a deficient number, since it is larger than the sum of its proper divisors (831159).
55683097 is an equidigital number, since it uses as much as digits as its factorization.
55683097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 831158.
The product of its (nonzero) digits is 226800, while the sum is 43.
The square root of 55683097 is about 7462.1107603680. The cubic root of 55683097 is about 381.8631880346.
The spelling of 55683097 in words is "fifty-five million, six hundred eighty-three thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •