Base | Representation |
---|---|
bin | 1101011010001000111… |
… | …0101000011010011111 |
3 | 211000120211121000201122 |
4 | 3112202032220122133 |
5 | 12233231340324411 |
6 | 253453523201155 |
7 | 22433261201012 |
oct | 3264216503237 |
9 | 730524530648 |
10 | 230355011231 |
11 | 89769442444 |
12 | 387895161bb |
13 | 18951103397 |
14 | b21373d379 |
15 | 5ed33269db |
hex | 35a23a869f |
230355011231 has 8 divisors (see below), whose sum is σ = 231172011600. Its totient is φ = 229539201408.
The previous prime is 230355011213. The next prime is 230355011281. The reversal of 230355011231 is 132110553032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 230355011231 - 214 = 230354994847 is a prime.
It is a super-2 number, since 2×2303550112312 (a number of 24 digits) contains 22 as substring.
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 230355011231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230355011281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 90920 + ... + 684818.
It is an arithmetic number, because the mean of its divisors is an integer number (28896501450).
Almost surely, 2230355011231 is an apocalyptic number.
230355011231 is a deficient number, since it is larger than the sum of its proper divisors (817000369).
230355011231 is an equidigital number, since it uses as much as digits as its factorization.
230355011231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 595273.
The product of its (nonzero) digits is 2700, while the sum is 26.
Adding to 230355011231 its reverse (132110553032), we get a palindrome (362465564263).
The spelling of 230355011231 in words is "two hundred thirty billion, three hundred fifty-five million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •