Base | Representation |
---|---|
bin | 1101011001001111000… |
… | …0000010100110100101 |
3 | 210222221220112102021021 |
4 | 3112103300002212211 |
5 | 12232232200023023 |
6 | 253413445051141 |
7 | 22424251446061 |
oct | 3262360024645 |
9 | 728856472237 |
10 | 230112111013 |
11 | 89654318964 |
12 | 387200b6ab1 |
13 | 189129a8445 |
14 | b1cd390aa1 |
15 | 5ebbd4635d |
hex | 3593c029a5 |
230112111013 has 4 divisors (see below), whose sum is σ = 237535082368. Its totient is φ = 222689139660.
The previous prime is 230112111001. The next prime is 230112111023. The reversal of 230112111013 is 310111211032.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 230112111013 - 229 = 229575240101 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 (230112111023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3711485631 + ... + 3711485692.
It is an arithmetic number, because the mean of its divisors is an integer number (59383770592).
Almost surely, 2230112111013 is an apocalyptic number.
It is an amenable number.
230112111013 is a deficient number, since it is larger than the sum of its proper divisors (7422971355).
230112111013 is an equidigital number, since it uses as much as digits as its factorization.
230112111013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7422971354.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 230112111013 its reverse (310111211032), we get a palindrome (540223322045).
The spelling of 230112111013 in words is "two hundred thirty billion, one hundred twelve million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •