Base | Representation |
---|---|
bin | 11011100011111… |
… | …01100011110100 |
3 | 121010001020011110 |
4 | 31301331203310 |
5 | 433141413022 |
6 | 34535235020 |
7 | 5505114300 |
oct | 1561754364 |
9 | 533036143 |
10 | 231201012 |
11 | 109563819 |
12 | 65518a70 |
13 | 38b8cb43 |
14 | 229c4d00 |
15 | 1546e00c |
hex | dc7d8f4 |
231201012 has 72 divisors (see below), whose sum is σ = 644566944. Its totient is φ = 64266048.
The previous prime is 231201011. The next prime is 231201023. The reversal of 231201012 is 210102132.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231201011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16443 + ... + 27069.
Almost surely, 2231201012 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 231201012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (322283472).
231201012 is an abundant number, since it is smaller than the sum of its proper divisors (413365932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231201012 is a wasteful number, since it uses less digits than its factorization.
231201012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10685 (or 10676 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 231201012 is about 15205.2955249150. The cubic root of 231201012 is about 613.7571675349.
Adding to 231201012 its reverse (210102132), we get a palindrome (441303144).
The spelling of 231201012 in words is "two hundred thirty-one million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •