Base | Representation |
---|---|
bin | 111011101000… |
… | …0010111111001 |
3 | 2011211021200022 |
4 | 1313100113321 |
5 | 31000342301 |
6 | 3034020225 |
7 | 526503305 |
oct | 167202771 |
9 | 64737608 |
10 | 31262201 |
11 | 16712833 |
12 | a577675 |
13 | 6627659 |
14 | 421ad05 |
15 | 2b27d1b |
hex | 1dd05f9 |
31262201 has 8 divisors (see below), whose sum is σ = 34843680. Its totient is φ = 27874368.
The previous prime is 31262159. The next prime is 31262207. The reversal of 31262201 is 10226213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31262201 - 214 = 31245817 is a prime.
It is a super-2 number, since 2×312622012 = 1954650422728802, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
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 31262201.
It is not an unprimeable number, because it can be changed into a prime (31262207) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48071 + ... + 48716.
It is an arithmetic number, because the mean of its divisors is an integer number (4355460).
Almost surely, 231262201 is an apocalyptic number.
It is an amenable number.
31262201 is a deficient number, since it is larger than the sum of its proper divisors (3581479).
31262201 is a wasteful number, since it uses less digits than its factorization.
31262201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96823.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 31262201 is about 5591.2611278673. The cubic root of 31262201 is about 315.0212499312.
Adding to 31262201 its reverse (10226213), we get a palindrome (41488414).
The spelling of 31262201 in words is "thirty-one million, two hundred sixty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •