Base | Representation |
---|---|
bin | 11011100011010… |
… | …10100101000110 |
3 | 121002220021112010 |
4 | 31301222211012 |
5 | 433131421040 |
6 | 34533435050 |
7 | 5504341530 |
oct | 1561524506 |
9 | 532807463 |
10 | 231123270 |
11 | 109510374 |
12 | 6549ba86 |
13 | 38b63641 |
14 | 229a4850 |
15 | 15455e80 |
hex | dc6a946 |
231123270 has 64 divisors (see below), whose sum is σ = 636341760. Its totient is φ = 52627968.
The previous prime is 231123257. The next prime is 231123271. The reversal of 231123270 is 72321132.
231123270 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231123271) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 57486 + ... + 61374.
It is an arithmetic number, because the mean of its divisors is an integer number (9942840).
Almost surely, 2231123270 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 231123270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (318170880).
231123270 is an abundant number, since it is smaller than the sum of its proper divisors (405218490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
231123270 is a wasteful number, since it uses less digits than its factorization.
231123270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4189.
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 231123270 is about 15202.7388979749. The cubic root of 231123270 is about 613.6883672900.
The spelling of 231123270 in words is "two hundred thirty-one million, one hundred twenty-three thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •