Base | Representation |
---|---|
bin | 10110100110110011010000 |
3 | 102011002002001 |
4 | 112212303100 |
5 | 3004113341 |
6 | 331003344 |
7 | 101241151 |
oct | 26466320 |
9 | 12132061 |
10 | 5926096 |
11 | 3388400 |
12 | 1b99554 |
13 | 12c6487 |
14 | b03928 |
15 | 7c0d31 |
hex | 5a6cd0 |
5926096 has 30 divisors (see below), whose sum is σ = 12624626. Its totient is φ = 2692800.
The previous prime is 5926093. The next prime is 5926097. The reversal of 5926096 is 6906295.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 5856400 + 69696 = 2420^2 + 264^2 .
It is a super-2 number, since 2×59260962 = 70237227602432, which contains 22 as substring.
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5926093) 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 5 ways as a sum of consecutive naturals, for example, 406 + ... + 3466.
Almost surely, 25926096 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5926096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6312313).
5926096 is an abundant number, since it is smaller than the sum of its proper divisors (6698530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5926096 is a wasteful number, since it uses less digits than its factorization.
5926096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3091 (or 3074 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 37.
The square root of 5926096 is about 2434.3574100777. The cubic root of 5926096 is about 180.9629056183.
The spelling of 5926096 in words is "five million, nine hundred twenty-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •