Base | Representation |
---|---|
bin | 1001110010011… |
… | …01100000100001 |
3 | 12201111102210211 |
4 | 10321031200201 |
5 | 132004401101 |
6 | 12051454121 |
7 | 2014615156 |
oct | 471154041 |
9 | 181442724 |
10 | 82106401 |
11 | 4238a833 |
12 | 235b7341 |
13 | 1401a090 |
14 | ac9422d |
15 | 731cc51 |
hex | 4e4d821 |
82106401 has 12 divisors (see below), whose sum is σ = 89333076. Its totient is φ = 75016800.
The previous prime is 82106399. The next prime is 82106407. The reversal of 82106401 is 10460128.
It can be written as a sum of positive squares in 2 ways, for example, as 13133376 + 68973025 = 3624^2 + 8305^2 .
It is not a de Polignac number, because 82106401 - 21 = 82106399 is a prime.
It is a super-2 number, since 2×821064012 = 13482922170345602, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (82106407) 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 11 ways as a sum of consecutive naturals, for example, 296275 + ... + 296551.
It is an arithmetic number, because the mean of its divisors is an integer number (7444423).
Almost surely, 282106401 is an apocalyptic number.
It is an amenable number.
82106401 is a deficient number, since it is larger than the sum of its proper divisors (7226675).
82106401 is a wasteful number, since it uses less digits than its factorization.
82106401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592 (or 441 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 22.
The square root of 82106401 is about 9061.2582459612. The cubic root of 82106401 is about 434.6359767805.
Adding to 82106401 its reverse (10460128), we get a palindrome (92566529).
The spelling of 82106401 in words is "eighty-two million, one hundred six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •