Base | Representation |
---|---|
bin | 1101100001001010110… |
… | …1100000001110011111 |
3 | 211012110100120201200012 |
4 | 3120102231200032133 |
5 | 12301112442333401 |
6 | 254405055153435 |
7 | 22531114503116 |
oct | 3302255401637 |
9 | 735410521605 |
10 | 232242152351 |
11 | 8a547705500 |
12 | 3901551587b |
13 | 18b92084031 |
14 | b35221ac7d |
15 | 6093d448bb |
hex | 3612b6039f |
232242152351 has 24 divisors (see below), whose sum is σ = 259294446432. Its totient is φ = 207828632000.
The previous prime is 232242152347. The next prime is 232242152371. The reversal of 232242152351 is 153251242232.
232242152351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 232242152351 - 22 = 232242152347 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232242152371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2059310 + ... + 2169156.
It is an arithmetic number, because the mean of its divisors is an integer number (10803935268).
Almost surely, 2232242152351 is an apocalyptic number.
232242152351 is a deficient number, since it is larger than the sum of its proper divisors (27052294081).
232242152351 is a wasteful number, since it uses less digits than its factorization.
232242152351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110143 (or 110132 counting only the distinct ones).
The product of its digits is 28800, while the sum is 32.
Adding to 232242152351 its reverse (153251242232), we get a palindrome (385493394583).
The spelling of 232242152351 in words is "two hundred thirty-two billion, two hundred forty-two million, one hundred fifty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •