Base | Representation |
---|---|
bin | 1101011101101010011… |
… | …1010101101011111111 |
3 | 211010000202122212010102 |
4 | 3113122213111223333 |
5 | 12242201024342343 |
6 | 254131435231315 |
7 | 22465566110261 |
oct | 3273247255377 |
9 | 733022585112 |
10 | 231301012223 |
11 | 8a104433a46 |
12 | 389b22a853b |
13 | 18a720b4b98 |
14 | b2a3231b31 |
15 | 603b3dd3b8 |
hex | 35da9d5aff |
231301012223 has 4 divisors (see below), whose sum is σ = 236942500368. Its totient is φ = 225659524080.
The previous prime is 231301012207. The next prime is 231301012247. The reversal of 231301012223 is 322210103132.
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 231301012223 - 24 = 231301012207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 231301012195 and 231301012204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (231301015223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2820744011 + ... + 2820744092.
It is an arithmetic number, because the mean of its divisors is an integer number (59235625092).
Almost surely, 2231301012223 is an apocalyptic number.
231301012223 is a deficient number, since it is larger than the sum of its proper divisors (5641488145).
231301012223 is an equidigital number, since it uses as much as digits as its factorization.
231301012223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5641488144.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 231301012223 its reverse (322210103132), we get a palindrome (553511115355).
Subtracting 231301012223 from its reverse (322210103132), we obtain a palindrome (90909090909).
The spelling of 231301012223 in words is "two hundred thirty-one billion, three hundred one million, twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •