Base | Representation |
---|---|
bin | 1101100000101010001… |
… | …1010001110110100111 |
3 | 211012002210222120212102 |
4 | 3120022203101312213 |
5 | 12300322421114221 |
6 | 254343325042315 |
7 | 22524533052350 |
oct | 3301243216647 |
9 | 735083876772 |
10 | 232105254311 |
11 | 8a487401a27 |
12 | 38b976b639b |
13 | 18b6c8c1888 |
14 | b33bd82d27 |
15 | 6086d0230b |
hex | 360a8d1da7 |
232105254311 has 16 divisors (see below), whose sum is σ = 274661936640. Its totient is φ = 191910858720.
The previous prime is 232105254259. The next prime is 232105254317. The reversal of 232105254311 is 113452501232.
232105254311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-232105254311 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232105254317) 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 15 ways as a sum of consecutive naturals, for example, 302531 + ... + 745476.
It is an arithmetic number, because the mean of its divisors is an integer number (17166371040).
Almost surely, 2232105254311 is an apocalyptic number.
232105254311 is a deficient number, since it is larger than the sum of its proper divisors (42556682329).
232105254311 is a wasteful number, since it uses less digits than its factorization.
232105254311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049134.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 232105254311 its reverse (113452501232), we get a palindrome (345557755543).
The spelling of 232105254311 in words is "two hundred thirty-two billion, one hundred five million, two hundred fifty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •