Base | Representation |
---|---|
bin | 110010010010… |
… | …0000001110100 |
3 | 1211121022211100 |
4 | 1210210001310 |
5 | 23222040342 |
6 | 2341010100 |
7 | 440034030 |
oct | 144440164 |
9 | 54538740 |
10 | 26361972 |
11 | 1397615a |
12 | 89b3930 |
13 | 5600100 |
14 | 37031c0 |
15 | 24aae4c |
hex | 1924074 |
26361972 has 108 divisors (see below), whose sum is σ = 82598880. Its totient is φ = 6941376.
The previous prime is 26361961. The next prime is 26361983. The reversal of 26361972 is 27916362.
26361972 is a `hidden beast` number, since 2 + 636 + 19 + 7 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (26361961) and next prime (26361983).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 42279 + ... + 42897.
Almost surely, 226361972 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 26361972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41299440).
26361972 is an abundant number, since it is smaller than the sum of its proper divisors (56236908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
26361972 is a wasteful number, since it uses less digits than its factorization.
26361972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 662 (or 644 counting only the distinct ones).
The product of its digits is 27216, while the sum is 36.
The square root of 26361972 is about 5134.3911031397. The cubic root of 26361972 is about 297.6180714399.
The spelling of 26361972 in words is "twenty-six million, three hundred sixty-one thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •