Base | Representation |
---|---|
bin | 110001101001… |
… | …1011110100001 |
3 | 1210222120020101 |
4 | 1203103132201 |
5 | 23131011113 |
6 | 2325542401 |
7 | 434161066 |
oct | 143233641 |
9 | 53876211 |
10 | 26032033 |
11 | 13770285 |
12 | 8874a01 |
13 | 5515b91 |
14 | 3658c6d |
15 | 24432dd |
hex | 18d37a1 |
26032033 has 16 divisors (see below), whose sum is σ = 28556800. Its totient is φ = 23639040.
The previous prime is 26031997. The next prime is 26032057. The reversal of 26032033 is 33023062.
It is not a de Polignac number, because 26032033 - 217 = 25900961 is a prime.
It is a super-2 number, since 2×260320332 = 1355333484226178, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 26032033.
It is not an unprimeable number, because it can be changed into a prime (26032073) 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 15 ways as a sum of consecutive naturals, for example, 113563 + ... + 113791.
It is an arithmetic number, because the mean of its divisors is an integer number (1784800).
Almost surely, 226032033 is an apocalyptic number.
It is an amenable number.
26032033 is a deficient number, since it is larger than the sum of its proper divisors (2524767).
26032033 is a wasteful number, since it uses less digits than its factorization.
26032033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472.
The product of its (nonzero) digits is 648, while the sum is 19.
The square root of 26032033 is about 5102.1596407796. The cubic root of 26032033 is about 296.3712205468.
Adding to 26032033 its reverse (33023062), we get a palindrome (59055095).
The spelling of 26032033 in words is "twenty-six million, thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •