Base | Representation |
---|---|
bin | 1101011100111011010… |
… | …0001011101000111111 |
3 | 211002111222011110020022 |
4 | 3113032310023220333 |
5 | 12241244340133401 |
6 | 254100044242355 |
7 | 22460643350633 |
oct | 3271664135077 |
9 | 732458143208 |
10 | 231103052351 |
11 | 8a012714846 |
12 | 38957b403bb |
13 | 18a40093372 |
14 | b284c20dc3 |
15 | 6028d3871b |
hex | 35ced0ba3f |
231103052351 has 4 divisors (see below), whose sum is σ = 231169829304. Its totient is φ = 231036275400.
The previous prime is 231103052321. The next prime is 231103052407. The reversal of 231103052351 is 153250301132.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 231103052351 - 26 = 231103052287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 231103052351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231103052311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33383285 + ... + 33390206.
It is an arithmetic number, because the mean of its divisors is an integer number (57792457326).
Almost surely, 2231103052351 is an apocalyptic number.
231103052351 is a deficient number, since it is larger than the sum of its proper divisors (66776953).
231103052351 is an equidigital number, since it uses as much as digits as its factorization.
231103052351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66776952.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 231103052351 its reverse (153250301132), we get a palindrome (384353353483).
The spelling of 231103052351 in words is "two hundred thirty-one billion, one hundred three million, fifty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •