Base | Representation |
---|---|
bin | 1101100000111… |
… | …0001111101010 |
3 | 10221122201022222 |
4 | 3120032033222 |
5 | 104002301300 |
6 | 5342514042 |
7 | 1255533020 |
oct | 330161752 |
9 | 127581288 |
10 | 56681450 |
11 | 29aa4681 |
12 | 16b95922 |
13 | b987627 |
14 | 7756710 |
15 | 4e99785 |
hex | 360e3ea |
56681450 has 24 divisors (see below), whose sum is σ = 120489312. Its totient is φ = 19433520.
The previous prime is 56681441. The next prime is 56681459. The reversal of 56681450 is 5418665.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (56681441) and next prime (56681459).
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 56681450.
It is not an unprimeable number, because it can be changed into a prime (56681459) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 80624 + ... + 81323.
It is an arithmetic number, because the mean of its divisors is an integer number (5020388).
Almost surely, 256681450 is an apocalyptic number.
56681450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56681450 is an abundant number, since it is smaller than the sum of its proper divisors (63807862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56681450 is a wasteful number, since it uses less digits than its factorization.
56681450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161966 (or 161961 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 35.
The square root of 56681450 is about 7528.7083885617. The cubic root of 56681450 is about 384.1318494354.
The spelling of 56681450 in words is "fifty-six million, six hundred eighty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •