Base | Representation |
---|---|
bin | 11011101010110… |
… | …10010010100101 |
3 | 121011202011101010 |
4 | 31311122102211 |
5 | 433404331000 |
6 | 35010452433 |
7 | 5515601220 |
oct | 1565322245 |
9 | 534664333 |
10 | 232105125 |
11 | 10a02101a |
12 | 65894119 |
13 | 39118515 |
14 | 22b7c5b7 |
15 | 1559bd50 |
hex | dd5a4a5 |
232105125 has 64 divisors (see below), whose sum is σ = 456768000. Its totient is φ = 102412800.
The previous prime is 232105123. The next prime is 232105151. The reversal of 232105125 is 521501232.
It is not a de Polignac number, because 232105125 - 21 = 232105123 is a prime.
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 (232105123) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 74601 + ... + 77649.
It is an arithmetic number, because the mean of its divisors is an integer number (7137000).
Almost surely, 2232105125 is an apocalyptic number.
232105125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
232105125 is a deficient number, since it is larger than the sum of its proper divisors (224662875).
232105125 is a wasteful number, since it uses less digits than its factorization.
232105125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3103 (or 3093 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 232105125 is about 15234.9967180830. The cubic root of 232105125 is about 614.5561606934.
Adding to 232105125 its reverse (521501232), we get a palindrome (753606357).
It can be divided in two parts, 232 and 105125, that multiplied together give a cube (24389000 = 2903).
The spelling of 232105125 in words is "two hundred thirty-two million, one hundred five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •